Items where Subject is "Q Science / természettudomány > QA Mathematics / matematika > QA166-QA166.245 Graphs theory / gráfelmélet"

A

Abu-Khazneh, A. and Barát, János and Pokrovskiy, A. and Szabó, Tibor (2019) A family of extremal hypergraphs for Ryser's conjecture. JOURNAL OF COMBINATORIAL THEORY SERIES A, 161. pp. 164-177. ISSN 0097-3165

Ackerman, E. and Keszegh, Balázs and Vizer, Máté (2017) On the size of planarly connected crossing graphs. JOURNAL OF GRAPH ALGORITHMS AND APPLICATIONS. ISSN 1526-1719

Ackerman, E. and Keszegh, Balázs and Vizer, Máté (2016) On the size of planarly connected crossing graphs. LECTURE NOTES IN COMPUTER SCIENCE, 9801. pp. 311-320. ISSN 0302-9743

Ackerman, Eyal and Keszegh, Balázs (2023) On the Number of Tangencies Among 1-Intersecting Curves. In: European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'23), 2023.08.28.- 2023.09.01., Prága.

Ackerman, Eyal and Keszegh, Balázs and Vizer, Máté (2016) On the size of planarly connected crossing graphs. Lecture Notes in Computer Science (LNCS) : Proceedings of Graph Drawing 2016. (In Press)

Anderson, Connor and Balasubramanian, Akshaj and Poskanzer, Henry and Reichman, Daniel and Sárközy, Gábor (2023) New ordering methods to construct contagious sets and degenerate subgraphs. INVOLVE: A JOURNAL OF MATHEMATICS. ISSN 1944-4176

Andrade, G.P. and Ruszinkó, Miklós and Kozma, R. (2018) Graph Models of Neurodynamics to Support Oscillatory Associative Memories. In: 2018 International Joint Conference on Neural Networks, IJCNN 2018. IEEE. ISBN 9781509060146

Andrásfai, B. and Erdős, Pál and T. Sós, Vera (1974) On the connection between chromatic number, maximal clique and minimal degree of a graph. DISCRETE MATHEMATICS, 8 (3). pp. 205-218. ISSN 0012-365X

Anglès d'Auriac, J.-A. and Bujtás, Cs. and El Maftouhi, A. and Karpinski, M. and Manoussakis, Y. and Tuza, Zs. (2018) Tropical dominating sets in vertex-coloured graphs. JOURNAL OF DISCRETE ALGORITHMS, 48. pp. 27-41. ISSN 1570-8667

Araujo-Pardo, Gabriela and Balbuena, Camino and Héger, Tamás (2010) Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages. DISCRETE MATHEMATICS, 310 (8). pp. 1301-1306. ISSN 0012-365X

Axenovich, Maria and Gyárfás, András (2019) A note on Ramsey numbers for Berge- G hypergraphs. DISCRETE MATHEMATICS, 342 (5). pp. 1245-1252. ISSN 0012-365X

B

Babai, László and Wilmes, John (2016) Asymptotic Delsarte cliques in distance-regular graphs. Journal of Algebraic Combinatorics, 43 (4). pp. 771-782. ISSN 0925-9899, ESSN: 1572-9192

Babarczi, Péter and Rétvári, Gábor and Rónyai, Lajos and Tapolcai, János (2022) Routing on the Shortest Pairs of Disjoint Paths. In: IFIP Networking Conference, 2022. június 13-16., Catania, Italy.

Backhausz, Ágnes and Kiss, István Z. and Simon L., Péter (2022) The Impact of Spatial and Social Structure on an SIR Epidemic on a Weighted Multilayer Network. PERIODICA MATHEMATICA HUNGARICA. pp. 1-21. ISSN 0031-5303 (print); 1588-2829 (online)

Backhausz, Ágnes and Kunszenti-Kovács, Dávid (2019) ON THE DENSE PREFERENTIAL ATTACHMENT GRAPH MODELS AND THEIR GRAPHON INDUCED COUNTERPART. Journal of Applied Probability, 56 (2). pp. 590-601. ISSN 0021-9002

Backhausz, Ágnes and Rozner, Bence (2019) Asymptotic degree distribution in preferential attachment graph models with multiple type edges. Stochastic Models. ISSN 1532-4214 (In Press)

Backhausz, Ágnes and Szegedy, Balázs (2018) On large-girth regular graphs and random processes on trees. RANDOM STRUCTURES & ALGORITHMS, 53 (3). pp. 389-416. ISSN 1042-9832

Backhausz, Ágnes and Szegedy, Balázs (2019) On the almost eigenvectors of random regular graphs. ANNALS OF PROBABILITY, 47 (3). pp. 1677-1725. ISSN 0091-1798

Backhausz, Ágnes and Virág, Bálint (2017) Spectral measures of factor of i.i.d. processes on vertex-transitive graphs. Annales de l'Institut Henri Poincare (B) Probability and Statistics, 53 (4). pp. 2260-2278. ISSN 0246-0203

Bacsó, Gábor and Bujtás, Csilla and Tompkins, Casey and Tuza, Zsolt (2019) Disjoint Paired-Dominating sets in Cubic Graphs. GRAPHS AND COMBINATORICS, 35. pp. 1129-1138. ISSN 0911-0119

Bacsó, Gábor and Lokshtanov, Daniel and Marx, Dániel and Pilipczuk, Marcin and Tuza, Zsolt (2018) Subexponential-Time Algorithms for Maximum Independent Set in Pt-Free and Broom-Free Graphs. ALGORITHMICA. pp. 1-18. ISSN 0178-4617

Bacsó, Gábor and Marx, Dániel and Tuza, Zsolt (2017) H-free graphs, Independent Sets, and subexponential-time algorithms. In: 11th International Symposium on Parameterized and Exact Computation, IPEC 2016. Leibniz International Proceedings in Informatics, LIPIcs (63). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, 3:1-3:12. ISBN 9783959770231

Bacsó, Gábor and Ryjáček, Zdenek and Tuza, Zsolt (2017) Coloring the cliques of line graphs. DISCRETE MATHEMATICS, 340 (11). pp. 2641-2649. ISSN 0012-365X

Bacsó, Gábor and Túri, József and Tuza, Zsolt (2022) Connected domination in random graphs. INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS. ISSN 0019-5588 (In Press)

Balka, Richárd and Darji, U. B. and Elekes, Márton (2016) Hausdorff and packing dimension of fibers and graphs of prevalent continuous maps. ADVANCES IN MATHEMATICS, 293. pp. 221-274. ISSN 0001-8708

Balka, Richárd and Elekes, Márton and Kiss, Viktor and Poór, Márk (2021) Singularity of Maps of Several Variables and a Problem of Mycielski Concerning Prevalent Homeomorphisms. ADVANCES IN MATHEMATICS, 385. pp. 1-36. ISSN 0001-8708 (print); 1090-2082 (online)

Balko, Martin and Vizer, Máté (2020) Edge-ordered Ramsey numbers. European Journal of Combinatorics, 87. p. 103100. ISSN 01956698

Balko, Martin and Vizer, Máté (2022) On ordered Ramsey numbers of tripartite 3-uniform hypergraphs. SIAM JOURNAL ON DISCRETE MATHEMATICS, 36 (1). pp. 214-228. ISSN 0895-4801

Bartoli, Daniele and Héger, Tamás and Kiss, György and Takáts, Marcella (2018) On the metric dimension of affine planes, biaffine planes and generalized quadrangles. AUSTRALASIAN JOURNAL OF COMBINATORICS.

Barát, János (2019) Decomposition of cubic graphs related to Wegner’s conjecture. DISCRETE MATHEMATICS, 342 (5). pp. 1520-1527. ISSN 0012-365X

Barát, János and Blázsik, Zoltán L. (2024) Improved upper bound on the Frank number of 3-edge-connected graphs. EUROPEAN JOURNAL OF COMBINATORICS, 118. ISSN 0195-6698

Barát, János and Gyárfás, András and Lehel, József and Sárközy, Gábor (2016) Ramsey number of paths and connected matchings in Ore-type host graphs. DISCRETE MATHEMATICS, 339 (6). pp. 1690-1698. ISSN 0012-365X

Barát, János and Gyárfás, András and Tóth, Géza (2024) Monochromatic spanning trees and matchings in ordered complete graphs. JOURNAL OF GRAPH THEORY, 105 (4). pp. 523-541. ISSN 0364-9024

Barát, János and Nagy, Zoltán Lóránt (2018) Transversals in generalized Latin squares. Ars Mathematica Contemporanea, 16 (1). pp. 39-47. ISSN 1855-3966

Barát, János and Sárközy, Gábor (2016) Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles. JOURNAL OF GRAPH THEORY, 81 (4). pp. 317-328. ISSN 0364-9024

Barát, János and Thomassen, Carsten (2006) Claw-Decompositions and Tutte-Orientations. JOURNAL OF GRAPH THEORY. ISSN 0364-9024

Barát, János and Tóth, Géza (2020) Improvement on the Crossing Number of Crossing-Critical Graphs. DISCRETE AND COMPUTATIONAL GEOMETRY. ISSN 0179-5376

Barát, János and Tóth, Géza (2017) Improvements on the density of maximal 1-planar graphs. JOURNAL OF GRAPH THEORY. ISSN 0364-9024

Barát, János and Tóth, Géza (2017) Improvements on the density of maximal 1-planar graphs. JOURNAL OF GRAPH THEORY. ISSN 0364-9024

Bazgan, Cristina and Pontoizeau, Thomas and Tuza, Zsolt (2017) On the complexity of finding a potential community. In: CIAC 2017: Algorithms and Complexity. Lecture Notes in Computer Science (10236). Springer, Cham, pp. 80-91. ISBN 978-3-319-57585-8

Bencs, Ferenc and Csíkvári, Péter (2023) Upper bound for the number of spanning forests of regular graphs. EUROPEAN JOURNAL OF COMBINATORICS, 110. ISSN 0195-6698

Bencs, Ferenc and Davies, E. and Patel, V. and Regts, G. (2019) On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs. Annales de l'Institut Henri Poincare (D) Combinatorics, Physics and their Interactions. ISSN 2308-5827

Bencs, Ferenc and Hrušková, Aranka and Tóth, László Márton (2024) Factor-of-Iid Balanced Orientation of Non-Amenable Graphs. EUROPEAN JOURNAL OF COMBINATORICS, 115. No.-103784. ISSN 0195-6698 (print); 1095-9971 (online)

Benjamini, Itai and Fraczyk, Mikolaj and Kun, Gábor (2022) Expander spanning subgraphs with large girth. ISRAEL JOURNAL OF MATHEMATICS. pp. 1-11. ISSN 0021-2172 (Submitted)

Beringer, Dorottya and Timár, Ádám (2018) Controllability, matching ratio and graph convergence. JOURNAL OF STATISTICAL PHYSICS. ISSN 0022-4715

Blázsik, L. Zoltán and Blokhuis, Aart and Miklavic, Stefko and Nagy, Zoltán Lóránt and Szőnyi, Tamás (2021) On the balanced upper chromatic number of finite projective planes. DISCRETE MATHEMATICS, 344 (3). ISSN 0012-365X

Blázsik, Zoltán L. and Nagy, Zoltán Lóránt (2020) Spreading linear triple systems and expander triple systems. EUROPEAN JOURNAL OF COMBINATORICS, 89. ISSN 0195-6698

Bodó, Ágnes (2019) SIS típusú járványterjedés vizsgálata hipergráfokon = SIS Epidemic Propagation on Hypergraphs. ALKALMAZOTT MATEMATIKAI LAPOK, 36 (2). pp. 189-195. ISSN 0133-3399

Bodó, Ágnes and Katona, Gyula Y. and Simon L., Péter (2016) SIS Epidemic Propagation on Hypergraphs. Bulletin of Mathematical Biology, 78 (4). pp. 713-735. ISSN 0092-8240 (print), 1522-9602 (online)

Boha, Roland and Tóth, Brigitta and Kardos, Zsófia and File, Bálint and Gaál, Zsófia Anna and Molnár, Márk (2016) Aritmetikai feladat elektrofiziológiai elemzése a „minimális feszítő fák” módszerével. IDEGGYOGYASZATI SZEMLE-CLINICAL NEUROSCIENCE, 69 (5-6). pp. 169-176. ISSN 0019-1442

Borgs, C. and Chayes, J. and Lovász, László and T. Sós, Vera and Vesztergombi, Katalin (2011) Limits of randomly grown graph sequences. EUROPEAN JOURNAL OF COMBINATORICS, 32 (7). pp. 985-999. ISSN 0195-6698

Borgs, C. and Chayes, J. and T. Sós, Vera and Lovász, László and Vesztergombi, Katalin (2006) Counting graph homomorphisms. In: Topics in discrete mathematics. Springer-Verlag London Ltd, New York (NY), Heidelberg, Basel, pp. 315-371. ISBN 9783540336983

Borgs, C. and Chayes, J. T. and Lovász, László and T. Sós, Vera and Vesztergombi, Katalin (2008) Convergent sequences of dense graphs I : Subgraph frequencies, metric properties and testing. ADVANCES IN MATHEMATICS, 219 (6). pp. 1801-1851. ISSN 0001-8708

Borgs, C. and Chayes, J. T. and Lovász, László and T. Sós, Vera and Vesztergombi, Katalin (2012) Convergent sequences of dense graphs II. Multiway cuts and statistical physics. ANNALS OF MATHEMATICS, 176 (1). pp. 151-219. ISSN 0003-486X

Bozóki, Sándor (2014) Inefficient weights from pairwise comparison matrices with arbitrarily small inconsistency. Optimization, 63 (12). pp. 1893-1901. ISSN 0233-1934

Bozóki, Sándor (2014) Nontransitive dice sets realizing the Paley tournaments for solving Schütte's tournament problem. MISKOLC MATHEMATICAL NOTES, 15 (1). pp. 39-50. ISSN 1787-2405

Bozóki, Sándor (2017) Two short proofs regarding the logarithmic least squares optimality in Chen, K., Kou, G., Tarn, J.M., Song, J. (2015): Bridging the gap between missing and inconsistent values in eliciting preference from pairwise comparison matrices, Annals of Operations Research 235(1):155-175. Annals of Operations Research, 253 (1). pp. 707-708. ISSN 0254-5330

Bozóki, Sándor and Csató, László and Temesi, József (2016) An application of incomplete pairwise comparison matrices for ranking top tennis players. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 248 (1). pp. 211-218. ISSN 0377-2217

Bozóki, Sándor and Dezső, Linda and Poesz, Attila and Temesi, József (2013) Analysis of pairwise comparison matrices: an empirical research. Annals of Operations Research, 211 (1). pp. 511-528. ISSN 0254-5330

Bozóki, Sándor and Fülöp, János and Rónyai, Lajos (2010) On optimal completions of incomplete pairwise comparison matrices. Mathematical and Computer Modelling, 52 (1-2). pp. 318-333. ISSN 0895-7177

Bozóki, Sándor and Poesz, Attila and Fülöp, János (2011) On pairwise comparison matrices that can be made consistent by the modification of a few elements. CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 19 (2). pp. 157-175. ISSN 1435-246X

Bresar, Bostjan and Bujtás, Csilla and Gologranc, Tanja and Klavzar, Sandi and Kosmrlj, Gasper and Patkós, Balázs and Tuza, Zsolt and Vizer, Máté (2016) Dominating sequences in grid-like and toroidal graphs. ELECTRONIC JOURNAL OF COMBINATORICS. ISSN 1077-8926 (Submitted)

Bresar, Bostjan and Bujtás, Csilla and Gologranc, Tanja and Klavzar, Sandi and Kosmrlj, Gasper and Patkós, Balázs and Tuza, Zsolt and Vizer, Máté (2017) Grundy dominating sequences and zero forcing sets. Discrete Optimization. ISSN 1572-5286 (In Press)

Bresar, Bostjan and Bujtás, Csilla and Gologranc, Tanja and Klavzar, Sandi and Kosmrlj, Gasper and Patkós, Balázs and Tuza, Zsolt and Vizer, Máté (2017) Grundy dominating sequences and zero forcing sets. Discrete Optimization. pp. 1-14. ISSN 1572-5286

Brown, W. G. and Erdős, Pál and T. Sós, Vera (1973) On the existence of triangulated spheres in 3-graphs and related problems. PERIODICA MATHEMATICA HUNGARICA, 3. pp. 221-229. ISSN 0031-5303

Brown, W. G. and Erdős, Pál and T. Sós, Vera (1973) Some extremal problems on gamma-graphs. In: New Directions in the Theory of Graphs. Academic Press, Inc, New York (NY), pp. 55-63.

Bujtás, Csilla and Henning, M. A. and Tuza, Zsolt (2017) Bounds on the game transversal number in hypergraphs. EUROPEAN JOURNAL OF COMBINATORICS, 59. pp. 34-50. ISSN 0195-6698

Bujtás, Csilla and Henning, M. A. and Tuza, Zsolt (2016) Transversal game on hypergraphs and the 3/4-Conjecture on the total domination game. SIAM JOURNAL ON DISCRETE MATHEMATICS, 30 (3). pp. 1830-1847. ISSN 0895-4801

Bujtás, Csilla and Patkós, Balázs and Tuza, Zsolt and Vizer, Máté (2019) Domination game on uniform hypergraphs. DISCRETE APPLIED MATHEMATICS, 258. pp. 65-75. ISSN 0166-218X

Bujtás, Csilla and Patkós, Balázs and Tuza, Zsolt and Vizer, Máté (2017) The minimum number of vertices in uniform hypergraphs with given domination number. Discrete Mathematics, 340 (11). pp. 2704-2713. ISSN 0012-365X

Bujtás, Csilla and Sampathkumar, E. and Tuza, Zsolt and Dominic, C. and Pushpalatha, L (2016) When the vertex coloring of a graph is an edge coloring of its line graph - a rare coincidence. ARS COMBINATORIA, 128. pp. 165-173. ISSN 0381-7032

Bujtás, Csilla and Tuza, Zsolt (2016) The Disjoint Domination Game. Discrete Mathematics, 339 (7). pp. 1985-1992. ISSN 0012-365X

Bujtás, Csilla and Tuza, Zsolt (2017) F-WORM colorings: Results for 2-connected graphs. DISCRETE APPLIED MATHEMATICS, 231. pp. 131-138. ISSN 0166-218X

Bujtás, Csilla and Tuza, Zsolt (2016) Transversal designs and induced decompositions of graphs. JOURNAL OF COMBINATORICS, 7 (2-3). pp. 257-269. ISSN 2156-3527

Burr, S. A. and Erdős, Pál and Graham, R. L. and T. Sós, Vera (1989) Maximal anti-Ramsey graphs and the strong chromatic number. JOURNAL OF GRAPH THEORY, 13 (3). pp. 263-282. ISSN 0364-9024

Burr, S. A. and Erdős, Pál and T. Sós, Vera and Frankl, P. and Graham, R. L. (1988) Further results on maximal anti-Ramsey graphs. In: Graph Theory, Combinatorics and Its Applications, 1988.05.30-1988.06.03, Kalamazoo (MI).

Bérczi, Kristóf and Berger, André and Mnich, Matthias and Vincze, Roland (2019) Degree-bounded generalized polymatroids and approximating the metric many-visits TSP. Technical Report. UNSPECIFIED.

Bérczi, Kristóf and Boros, Endre and Cepek, Ondrej and Kucera, Petr and Makino, Kazuhisa (2021) Approximating minimum representations of key Horn functions. SIAM JOURNAL ON COMPUTING. ISSN 0097-5397 (print); 1095-7111 (online) (Submitted)

Bérczi, Kristóf and Chandrasekaran, Karthekeyan and Király, Tamás and Lee, E. and Xu, C. (2019) Beating the 2-approximation factor for Global Bicut. MATHEMATICAL PROGRAMMING. ISSN 0025-5610

Bérczi, Kristóf and Chandrasekaran, Karthekeyan and Király, Tamás and Madan, Vivek (2020) Improving the integrality gap for multiway cut. MATHEMATICAL PROGRAMMING. ISSN 0025-5610

Bérczi, Kristóf and Chandrasekaran, Karthekeyan and Király, Tamás and Madan, Vivek (2019) A tight sqrt(2)-approximation for linear 3-cut. MATHEMATICAL PROGRAMMING. ISSN 0025-5610

Bérczi, Kristóf and Mnich, Matthias and Vincze, Roland (2020) A 3/2-Approximation for the Metric Many-visits Path TSP. Technical Report. UNSPECIFIED.

Búr, Márton and Szilágyi, Gábor and Vörös, András and Varró, Dániel (2018) Distributed Graph Queries for Runtime Monitoring of Cyber-Physical Systems. In: Fundamental Approaches to Software Engineering, 2018.04.14-2018.04.20, Thessaloniki.

C

Candela, P. and Szegedy, Balázs and Vena, L. (2016) On Linear Configurations in Subsets of Compact Abelian Groups, and Invariant Measurable Hypergraphs. ANNALS OF COMBINATORICS, 20 (3). pp. 487-524. ISSN 0218-0006

Cechlárová, Katarína and Cseh, Ágnes and Jankó, Zsuzsanna and Kires, Marián and Mino, Lukás (2023) A Quest for a Fair Schedule: The International Young Physicists’ Tournament. JOURNAL OF SCHEDULING, 26. pp. 3-18. ISSN 1094-6136 (print); 1099-1425 (online)

Chuanqi, Xiao and Katona, Gyula (2023) Extremal Graphs without long paths and large cliques. EUROPEAN JOURNAL OF COMBINATORICS. ISSN 0195-6698

Chunqiu, Fang and Győri, Ervin and Chuanqi, Xiao and Jimeng, Xiao (2023) Turán numbers and anti-Ramsey numbers for short cycles in complete 3-partite graphs. ELECTRONIC JOURNAL OF COMBINATORICS. ISSN 1097-1440

Cichacz, S. and Görlich, A. and Tuza, Zsolt (2020) ℤ 2 × ℤ 2-Cordial Cycle-Free Hypergraphs. DISCUSSIONES MATHEMATICAE GRAPH THEORY. ISSN 1234-3099

Cohen, J. and Manoussakis, Y. and Phong, H. P. and Tuza, Zsolt (2017) Tropical matchings in vertex-colored graphs. ELECTRONIC NOTES IN DISCRETE MATHEMATICS, 62. pp. 219-224. ISSN 1571-0653

Colucci, Lucas and Erdős, Péter and Győri, Ervin and Mezei, Tamás (2017) Terminal-Pairability in Complete Bipartite Graphs. DISCRETE APPLIED MATHEMATICS, & (&). pp. 1-5. ISSN 0166-218X

Csaba, Béla (2019) A new graph decomposition method for bipartite graphs. In: Zbornik 22. mednarodne multikonference : Informacijska družba – IS 2019 Zvezek I = Proceedings of the 22nd International Multiconference : Information Society – IS 2019. Volume I. International Multiconference : Information Society: (1). Institut »Jožef Stefan«, Ljubljana, pp. 11-14. ISBN 978-961-264-171-9; 978-961-264-172-6

Csaba, Béla and Kühn, Daniela and Lo, Allan and Osthus, Deryk and Treglown, Andrew (2016) Proof of the 1-Factorization and Hamilton Decomposition Conjectures. American Mathematical Society, pp. 1-164. ISBN 978-1-4704-2025-3

Csaba, Zágon (2018) A bűnelemzés aktuális kihívásai a nemzetközi súlyos és szervezett bűnözés elleni európai fellépés terén. Szakmai Szemle (4). pp. 118-132. ISSN 1785-1181

Cseh, Ágnes and Kavitha, Telikepalli (2021) Popular Matchings in Complete Graphs. ALGORITHMICA. pp. 1-31. ISSN 0178-4617

Csonka, Bence and Simonyi, Gábor (2024) Shannon Capacity, Lovász Theta Number and the Mycielski Construction. IEEE TRANSACTIONS ON INFORMATION THEORY. pp. 1-35. ISSN 0018-9448 (print); 1557-9654 (online) (In Press)

Csáki, Endre and Földes, Antónia and Révész, Pál (2017) About the distance between random walkers on some graphs. PERIODICA MATHEMATICA HUNGARICA, 75 (1). pp. 36-57. ISSN 0031-5303

Csóka, Endre (2016) On the graph limit question of Vera T. Sos. JOURNAL OF COMBINATORIAL THEORY SERIES B, 116. pp. 306-311. ISSN 0095-8956

Czygrinow, A. and Hurlbert, G. and Katona, Gy. Y. and Papp, L. F. (2019) Optimal pebbling number of graphs with given minimum degree. DISCRETE APPLIED MATHEMATICS, 260. pp. 117-130. ISSN 0166-218X

D

Damásdi, Gábor and Gerbner, Dániel and Katona, Gyula and Methuku, Abhishek and Keszegh, Balázs and Lenger, Dániel and Nagy, Dániel and Pálvölgyi, Dömötör and Patkós, Balázs and Vizer, Máté and Wiener, Gábor (2019) Adaptive majority problems for restricted query graphs and for weighted sets. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 88 (3). pp. 601-609. ISSN 0862-9544

Damásdi, Gábor and Martínez-Sandoval, Leonardo and Nagy, Dániel and Nagy, Zoltán Lóránt (2020) Triangle areas in line arrangements. DISCRETE MATHEMATICS, 343 (12). ISSN 0012-365X

Davoodi, Akbar and Gerbner, Dániel and Methuku, Abhishek and Vizer, Máté (2020) On clique coverings of complete multipartite graphs. Discrete Applied Mathematics, 276. pp. 19-23. ISSN 0166218X

DeBiasio, Louis and Gyárfás, András (2022) Covering 2-colored complete digraphs by monochromatic d-dominating digraphs. JOURNAL OF GRAPH THEORY, 100 (4). pp. 721-726. ISSN 0364-9024

Di Battista, Giuseppe and Frati, Fabrizio and Pach, János (2013) On the queue number of planar graphs. SIAM JOURNAL ON COMPUTING, 42 (6). pp. 2243-2285. ISSN 0097-5397 (print); 1095-7111 (online)

Drgas-Burchardt, Ewa and Kowalska, Kamila and Michael, Jerzy and Tuza, Zsolt (2016) Some properties of vertex-oblique graphs. Discrete Mathematics, 339 (1). pp. 95-102. ISSN 0012-365X

E

Elek, Gábor (2016) Convergence and limits of linear representations of finite groups. Journal of Algebra, 450. pp. 588-615. ISSN 0021-8693

Elek, Gábor and T. Sós, Vera (2005) Paradoxical Decompositions And Growth Conditions. COMBINATORICS PROBABILITY AND COMPUTING, 14 (1-2). pp. 81-105. ISSN 0963-5483

Elekes, Márton and Nagy, Attila and Sándor, Dávid and Antal, János Benjamin and Davis, Timothy A. and Szárnyas, Gábor (2020) A GraphBLAS solution to the SIGMOD 2014 Programming Contest using multi-source BFS. In: 2020 IEEE High Performance Extreme Computing Conference (HPEC).

Elekes, Márton and Soukup, Dániel Tamás and Soukup, Lajos and Szentmiklóssy, Zoltán (2017) Decompositions of edge-colored infinite complete graphs into monochromatic paths. DISCRETE MATHEMATICS, 340 (8). pp. 2053-2069. ISSN 0012-365X

Elekes, Márton and Szárnyas, Gábor (2020) An Incremental GraphBLAS Solution for the 2018 TTC Social Media Case Study. In: GrAPL 2020: Workshop on Graphs, Architectures, Programming, and Learning.

English, Sean and Gerbner, Dániel and Methuku, Abhishek and Palmer, Cory (2019) On the weight of Berge-F-free hypergraphs. ELECTRONIC JOURNAL OF COMBINATORICS, 26 (4). pp. 1-7. ISSN 1077-8926

Erdős, Pál and Meir, A. and T. Sós, Vera and Turán, P. (2006) On Some Applications of Graph Theory, I. DISCRETE MATHEMATICS, 306 (10-11). pp. 853-866. ISSN 0012-365X

Erdős, Pál and Meir, A. and T. Sós, Vera and Turán, P. (1972) On some applications of graph theory, I. DISCRETE MATHEMATICS, 2 (3). pp. 207-228. ISSN 0012-365X

Erdős, Pál and Saks, M. and T. Sós, Vera (1986) Maximum induced trees in graphs. JOURNAL OF COMBINATORIAL THEORY SERIES B, 41 (1). pp. 61-79. ISSN 0095-8956

Erdős, Pál and Simonovits, Miklós and Rao, S. B. and T. Sós, Vera (1992) On totally supercompact graphs. SANKHYA A, 54. pp. 155-167. ISSN 0581-572X

Erdős, Pál and T. Sós, Vera (1982) On Ramsey-Turán type theorems for hypergraphs. COMBINATORICA, 2 (3). pp. 289-295. ISSN 0209-9683

Erdős, Pál and T. Sós, Vera (1983) On a generalization of Turán's graph-theorem. In: Studies in Pure Mathematics : To the Memory of Paul Turán. Birkhäuser Verlag, Basel, pp. 181-185. ISBN 978-3-7643-1288-6 (print); 978-3-0348-5438-2 (online)

Erdős, Péter and Hartke, S. G. and van Iersel, Leo and Miklós, István (2017) Graph realizations constrained by skeleton graphs. ELECTRONIC JOURNAL OF COMBINATORICS, 24 (2). #P2.47. ISSN 1097-1440

Erdős, Péter and Mezei, Tamás Róbert and Miklós, István and Soltész, Dániel (2018) Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs. PLOS ONE, 13 (8). ISSN 1932-6203

Erdős, Péter L. and Ferrara, Michael and Hartke, Stephen G. (2018) Navigating Between Packings of Graphic Sequences. DISCRETE APPLIED MATHEMATICS. pp. 1-13. ISSN 0166-218X

Ergemlidze, Beka and Győri, Ervin and Methuku, Abhishek (2017) 3-uniform hypergraphs and linear cycles. ELECTRONIC NOTES IN DISCRETE MATHEMATICS, 61. pp. 391-394. ISSN 1571-0653

Ergemlidze, Beka and Győri, Ervin and Methuku, Abhishek (2019) On the Rainbow Turan number of paths. ELECTRONIC JOURNAL OF COMBINATORICS, 26 (1). ISSN 1097-1440

Ergemlidze, Beka and Győri, Ervin and Methuku, Abhishek (2019) Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle. COMBINATORICS PROBABILITY AND COMPUTING, 28 (2). pp. 241-252. ISSN 0963-5483

Ergemlidze, Beka and Győri, Ervin and Methuku, Abhishek and Salia, Nika (2017) A note on the maximum number of triangles in a C5-free graph. ELECTRONIC NOTES IN DISCRETE MATHEMATICS, 61. pp. 395-398. ISSN 1571-0653

Ergemlidze, Beka and Győri, Ervin and Methuku, Abhishek and Salia, Nika and Tompkins, Casey (2023) On 3-uniform hypergraphs avoiding a cycle of length four. ELECTRONIC JOURNAL OF COMBINATORICS, 30 (4). ISSN 1097-1440

Ergemlidze, Beka and Methuku, Abhishek and Salia, Nika and Győri, Ervin (2019) A note on the maximum number of triangles in a C5-free graph. JOURNAL OF GRAPH THEORY, 90 (3). pp. 227-230. ISSN 0364-9024

F

Faghani, Morteza and Katona, Gyula Y. and Ashrafi, Ali Reza and Koorepazan-Moftakhar, Fatemeh (2013) A Lower Bound for Graph Energy of Fullerenes. In: Carbon Materials: Chemistry and Physics. Carbon Materials: Chemistry and Physics (7). Springer, Berlin; Heidelberg; New York, pp. 463-471. ISBN 978-94-007-6412-5

Fang, L. and Huang, H. and Pach, János and Tardos, Gábor and Zuo, J. (2023) Successive vertex orderings of fully regular graphs. JOURNAL OF COMBINATORIAL THEORY SERIES A, 199. ISSN 0097-3165

Farkas, Ábel (2019) Dimension approximation of attractors of graph directed IFSs by self-similar sets. MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 167 (1). pp. 193-207. ISSN 0305-0041 (print); 1469-8064 (online)

Ferrara, Michael and Füredi, Zoltán and Jahanbekam, Sogol and Wenger, Paul S. (2019) List-distinguishing Cartesian products of cliques. DISCRETE MATHEMATICS, 342 (7). pp. 2012-2022. ISSN 0012-365X

Fox, Jacob and Gromov, Mikhail and Lafforgue, Vincent and Naor, Assaf and Pach, János (2012) Overlap properties of geometric expanders. JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK (671). pp. 49-83. ISSN 1435-5345 (print); 0075-4102 (online)

Fox, Jacob and Pach, János (2012) Coloring Kk-free intersection graphs of geometric objects in the plane. EUROPEAN JOURNAL OF COMBINATORICS, 33 (5). pp. 853-866. ISSN 0195-6698

Fox, Jacob and Pach, János (2012) String graphs and incomparability graphs. ADVANCES IN MATHEMATICS, 230 (3). pp. 1381-1401. ISSN 0001-8708

Fox, Jacob and Pach, János and Sheffer, Ádám and Suk, Andrew and Zahl, Joshua (2017) A semi-algebraic version of Zarankiewicz's problem. JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY, 19 (6). pp. 1785-1810. ISSN 1435-9855

Fox, Jacob and Pach, János and Suk, Andrew (2017) Erdos-hajnal conjecture for graphs with bounded VC-Dimension. In: 33rd International Symposium on Computational Geometry, SoCG 2017. Leibniz International Proceedings in Informatics, LIPIcs (77). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 1-19. ISBN 9783959770385

Fox, Jacob and Pach, János and Suk, Andrew (2023) On the number of edges of separated multigraphs. JOURNAL OF GRAPH THEORY. ISSN 0364-9024

Frankl, Péter (2018) Resilient Hypergraphs with Fixed Matching Number. COMBINATORICA, 38 (5). pp. 1079-1094. ISSN 0209-9683

Füredi, Zoltán and Gerbner, Dániel (2021) Hypergraphs Without Exponents. JOURNAL OF COMBINATORIAL THEORY, SERIES A. pp. 1-10. ISSN 0097-3165 (print); 1096-0899 (online)

Füredi, Zoltán and Jiang, Tao and Kostochka, Alexandr and Mubayi, Dhruv and Verstraete, Jacques (2019) Hypergraphs Not Containing a Tight Tree with a Bounded Trunk. SIAM JOURNAL ON DISCRETE MATHEMATICS, 33 (2). pp. 862-873. ISSN 0895-4801

Füredi, Zoltán and Kostochka, Alexandr and Luo, Ruth (2019) Avoiding long Berge cycles. JOURNAL OF COMBINATORIAL THEORY SERIES B, 137. pp. 55-64. ISSN 0095-8956

Füredi, Zoltán and Kostochka, Alexandr and Luo, Ruth (2019) On 2-connected hypergraphs with no long cycles. The Electronic Journal of Combinatorics, 26 (4). pp. 1-33. ISSN 1077-8926

Füredi, Zoltán and Kostochka, Alexandr and Luo, Ruth (2019) A variation of a theorem by Pósa. DISCRETE MATHEMATICS, 342 (7). pp. 1919-1923. ISSN 0012-365X

Füredi, Zoltán and Kántor, Ida (2016) List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs. JOURNAL OF GRAPH THEORY, 82 (2). pp. 218-227. ISSN 0364-9024

Füredi, Zoltán and Luo, Ruth (2023) Induced Turán problems and traces of hypergraphs. EUROPEAN JOURNAL OF COMBINATORICS. ISSN 0195-6698

G

Gerbner, Dániel (2021) A Note on Stability for Maximal F-Free Graphs. GRAPHS AND COMBINATORICS, 37 (6). pp. 2571-2580. ISSN 0911-0119 (print)

Gerbner, Dániel (2021) A Note on the Turán Number of a Berge Odd Cycle. THE AUSTRALASIAN JOURNAL OF COMBINATORICS. pp. 1-7. ISSN 2202-3518 (In Press)

Gerbner, Dániel (2024) On Turán problems with bounded matching number. JOURNAL OF GRAPH THEORY, First. ISSN 0364-9024

Gerbner, Dániel (2021) On Turán-Good Graphs. DISCRETE MATHEMATICS, 344 (8). pp. 1-8. ISSN 0012-365X (print); 1872-681X (online)

Gerbner, Dániel and Győri, Ervin and Methuku, Abhishek and Vizer, Máté (2019) Generalized Turán problems for even cycles. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 88 (3). pp. 723-728. ISSN 0862-9544

Gerbner, Dániel and Keszegh, Balázs and Palmer, Cory and Patkós, Balázs (2018) On the Number of Cycles in a Graph with Restricted Cycle Lengths. SIAM JOURNAL ON DISCRETE MATHEMATICS, 32 (1). pp. 266-279. ISSN 0895-4801

Gerbner, Dániel and Methuku, Abhishek and Nagy, Dániel and Pálvölgyi, Dömötör and Tardos, Gábor and Vizer, Máté (2020) Turán problems for Edge-ordered graphs. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 88. pp. 717-722. ISSN 0862-9544

Gerbner, Dániel and Methuku, Abhishek and Omidi, Gholamreza and Vizer, Máté (2020) Ramsey Problems for Berge Hypergraphs. SIAM Journal on Discrete Mathematics, 34 (1). pp. 351-369. ISSN 0895-4801

Gerbner, Dániel and Nagy, Dániel and Patkós, Balázs and Salia, Nika and Vizer, Máté (2023) Stability of extremal connected hypergraphs avoiding Berge-paths. EUROPEAN JOURNAL OF COMBINATORICS. ISSN 0195-6698

Gerbner, Dániel and Palmer, Cory (2017) Extremal results for berge hypergraphs. SIAM JOURNAL ON DISCRETE MATHEMATICS, 31 (4). pp. 2314-2327. ISSN 0895-4801

Gerbner, Dániel and Patkós, Balázs and Tuza, Zsolt and Vizer, Máté (2020) Saturation problems with regularity constraints. EUROPEAN JOURNAL OF COMBINATORICS. ISSN 0195-6698 (In Press)

Gerbner, Dániel and Patkós, Balázs and Tuza, Zsolt and Vizer, Máté (2020) Some exact results for regular Turán problems. EUROPEAN JOURNAL OF COMBINATORICS. ISSN 0195-6698 (In Press)

Ghosh, Debarun and Győri, Ervin and Nagy-György, Judit and Addisu, Paulos and Chuanqi, Xiao and Zamora, Oscar (2024) Book free 3-uniform hypergraphs. DISCRETE MATHEMATICS, 347 (3). ISSN 0012-365X

Ghosh, Debarun and Győri, Ervin and Paulos, Addisu and Salia, Nika and Zamora, Oscar (2020) The Maximum Wiener Index of Maximal Planar Graphs. JOURNAL OF COMBINATORIAL OPTIMIZATION. ISSN 1382-6905

Granath, E. and Gyárfás, András and Hardee, J. and Watson, T. and Wu, X. (2018) Ramsey theory on Steiner triples. Journal of Combinatorial Designs, 26 (1). pp. 5-11. ISSN 1063-8539

Gujgiczer, Anna and Simonyi, Gábor (2024) Critical Subgraphs of Schrijver Graphs for the Fractional Chromatic Number. GRAPHS AND COMBINATORICS, 40. No.-64. ISSN 0911-0119 (print); 1435-5914 (online)

Gyárfás, András (2023) Problems close to my heart. EUROPEAN JOURNAL OF COMBINATORICS. ISSN 0195-6698

Gyárfás, András (2019) The Turán Number of Berge K-4 in Triple Systems. SIAM JOURNAL ON DISCRETE MATHEMATICS, 33 (1). pp. 383-392. ISSN 0895-4801

Gyárfás, András (2016) Vertex covers by monochromatic pieces - A survey of results and problems. DISCRETE MATHEMATICS, 399 (7). pp. 1970-1977. ISSN 0012-365X

Gyárfás, András and Győri, Ervin and Simonovits, Miklós (2016) On 3-uniform hypergraphs without linear cycles. JOURNAL OF COMBINATORICS, 7 (1). pp. 205-216. ISSN 2156-3527

Gyárfás, András and Riasanovsky, Alexander W. N. and Sherman-Bennett, Melissa U (2016) Chromatic Ramsey number of acyclic hypergraphs. DISCRETE MATHEMATICS, 340. pp. 373-378. ISSN 0012-365X

Gyárfás, András and Sárközy, Gábor (2016) Cliques in C_4-free graphs of large minimum degree. PERIODICA MATHEMATICA HUNGARICA, &. pp. 1-6. ISSN 0031-5303

Győri, Ervin and Katona, Gyula Y. and Lemons, Nathan (2016) Hypergraph extensions of the Erdős-Gallai Theorem. European Journal of Combinatorics, 58. pp. 238-246. ISSN 0195-6698

Győri, Ervin and Kensell, Scott and Tompkins, Casey (2016) Making a C6C6-free graph C4C4-free and bipartite. DISCRETE APPLIED MATHEMATICS, 209. pp. 133-136. ISSN 0166-218X

Győri, Ervin and Keszegh, Balázs (2017) On the number of edge-disjoint triangles in K4-free graphs. ELECTRONIC NOTES IN DISCRETE MATHEMATICS, 61. pp. 557-560. ISSN 1571-0653

Győri, Ervin and Kostochka, A. and McConvey, A. and Yager, D. (2016) A list version of graph packing. DISCRETE MATHEMATICS, 339 (8). pp. 2178-2185. ISSN 0012-365X

Győri, Ervin and Kostochka, A. and McConvey, Andrew and Yager, Derrek (2016) Toward Żak's conjecture on graph packing. JOURNAL OF COMBINATORICS, 7 (2-3). pp. 307-340. ISSN 2156-3527

Győri, Ervin and Lemons, Nathan and Salia, Nika and Zamora, O. (2019) The Structure of Hypergraphs without long Berge cycles. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 88 (3). pp. 767-771. ISSN 0862-9544

Győri, Ervin and Lemons, Nathan and Salia, Nika and Zamora, Oscar (2021) The Structure of Hypergraphs Without Long Berge Cycles. JOURNAL OF COMBINATORIAL THEORY, SERIES B. pp. 1-10. ISSN 0095-8956 (print); 1096-0902 (online)

Győri, Ervin and Mezei, Tamás and Mészáros, Gábor (2017) Note on terminal-pairability in complete grid graphs. DISCRETE MATHEMATICS, 340 (5). pp. 988-990. ISSN 0012-365X

H

Hatami, H. and Janson, Svante and Szegedy, Balázs (2018) Graph properties, graph limits, and entropy. JOURNAL OF GRAPH THEORY, 87 (2). pp. 208-229. ISSN 0364-9024

He, Zhen and Frankl, Péter and Győri, Ervin and Lv, Zequn and Salia, Nika and Tompkins, Casey and Varga, Kitti Katalin and Zhu, Xiutao (2024) Extremal Results for Graphs Avoiding a Rainbow Subgraph. ELECTRONIC JOURNAL OF COMBINATORICS, 31 (1). ISSN 1097-1440

Helle, Zita and Simonyi, Gábor (2016) Orientations Making k-Cycles Cyclic. GRAPHS AND COMBINATORICS, 32 (6). pp. 2415-2423. ISSN 0911-0119

J

Juhász, Ferenc (1981) On the spectrum of a random graph. In: Algebraic methods in graph theory. Colloquia Mathematica Societatis János Bolyai (25). North-Holland Publishing Co. ; János Bolyai Mathematical Society, Amsterdam; Budapest, pp. 313-316. ISBN 963-8021-40-3 ; 0-44-485442-8

Juhász, Ferenc (1982) The asymptotic behaviour of Lovász' theta function for random graphs. COMBINATORICA, 2 (2). pp. 153-155. ISSN 0209-9683

Jüttner, Alpár and Király, Csaba and Mendoza-Cadena, Lydia Mirabel and Pap, Gyula and Schlotter, Ildikó and Yamaguchi, Yutaro (2024) Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions. DISCRETE APPLIED MATHEMATICS : THE JOURNAL OF COMBINATORIAL ALGORITHMS, INFORMATICS AND COMPUTATIONAL SCIENCES, 357. pp. 34-50. ISSN 0166-218X (print); 1872-6771 (online)

K

Kalmár, Boldizsár (2016) Interlacement of Double Curves of Immersed Spheres. DISCRETE AND COMPUTATIONAL GEOMETRY, 55 (3). pp. 550-570. ISSN 0179-5376

Kaszanitzky, Viktória E. and Király, Csaba and Schulze, Bernd (2022) Sufficient Conditions for the Global Rigidity of Periodic Graphs. DISCRETE AND COMPUTATIONAL GEOMETRY : AN INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE, 67 (1). pp. 1-16. ISSN 0179-5376 (print); 1432-0444 (online)

Katona, Gyula Y. (2014) Extension of paths and cycles for hypergraphs. ELECTRONIC NOTES IN DISCRETE MATHEMATICS, 45. pp. 3-7. ISSN 1571-0653

Katona, Gyula Y. and Kano, Mikio and Varga, Kitti (2019) Decomposition of a graph into two disjoint odd subgraphs. In: Proceedings of the 11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications. Department of Mathematical Informatics, Tokyo, pp. 233-239. ISBN 9784600001599

Katona, Gyula Y. and Kierstead, H. (1997) Hamiltonian Chains in Hypergraphs. In: 5th Twente Workshop on graphs and combinatorial optimization, 1997.05.20-1997.05.22, Enschede.

Katona, Gyula Y. and Papp, László F. (2016) The optimal rubbling number of ladders, prisms and Möbius-ladders. DISCRETE APPLIED MATHEMATICS, 209. pp. 227-246. ISSN 0166-218X

Katona, Gyula Y. and Soltész, Dániel and Varga, Kitti Katalin (2018) Properties of minimally t-tough graphs. DISCRETE MATHEMATICS, 341 (1). pp. 221-231. ISSN 0012-365X

Katona, Gyula Y. and Szabó, Péter (2016) Bounds on the Number of Edges in Hypertrees. DISCRETE MATHEMATICS, 339 (7). pp. 1884-1991. ISSN 0012-365X

Kavitha, Telikepalli and Király, Tamás and Matuschke, Jannik and Schlotter, Ildikó and Schmidt-Kraepelin, Ulrike (2021) Popular Branchings and Their Dual Certificates. MATHEMATICAL PROGRAMMING : A PUBLICATION OF THE MATHEMATICAL OPTIMIZATION SOCIETY. pp. 1-29. ISSN 0025-5610 (print); 1436-4646 (online)

Keliger, Dániel and Horváth, Illés (2023) Accuracy criterion for mean field approximations of Markov processes on hypergraphs. PHYSICA A - STATISTICAL MECHANICS AND ITS APPLICATIONS, 609. ISSN 0378-4371

Keller, Chaya and Keszegh, Balázs and Pálvölgyi, Dömötör (2022) On the Number of Hyperedges in the Hypergraph of Lines and Pseudo-Discs. ELECTRONIC JOURNAL OF COMBINATORICS, 29 (3). ISSN 1097-1440

Keller, Chaya and Smorodinsky, Shakhar and Tardos, Gábor (2017) On max-clique for intersection graphs of sets and the hadwiger-debrunner numbers. In: 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms . Society for Industrial and Applied Mathematics (SIAM), Barcelona, pp. 2254-2263. ISBN 9781510836358

Keszegh, Balázs and Pálvölgyi, Dömötör (2017) Proper coloring of geometric hypergraphs. In: 33rd International Symposium on Computational Geometry, SoCG 2017. Leibniz International Proceedings in Informatics, LIPIcs (77). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 471-4715. ISBN 9783959770385

Keszegh, Balázs and Zhu, Xuding (2016) Choosability and paintability of the lexicographic product of graphs. DISCRETE APPLIED MATHEMATICS. ISSN 0166-218X (Submitted)

Keszegh, Balázs and Zhu, Xuding (2017) Choosability and paintability of the lexicographic product of graphs. DISCRETE APPLIED MATHEMATICS, 223. pp. 84-90. ISSN 0166-218X

Khadir, Omar and Németh, László and Szalay, László (2018) On sunlet graphs connected to a specific map on {1, 2, . . . , p − 1}. Annales Mathematicae et Informaticae, 49. pp. 101-107. ISSN 1787-6117

Király, Csaba and Mihálykó, András (2022) Globally Rigid Augmentation of Rigid Graphs. SIAM JOURNAL ON DISCRETE MATHEMATICS. pp. 1-25. ISSN 0895-4801 (print); 1095-7146 (online) (Submitted)

Kiss, György and Miklavič, Štefko and Szőnyi, Tamás (2021) A stability result for girth-regular graphs with even girth. JOURNAL OF GRAPH THEORY. ISSN 0364-9024 (In Press)

Korándi, Dániel and Tardos, Gábor and Tomon, István and Weidert, Craig (2017) On the Turán number of ordered forests. ELECTRONIC NOTES IN DISCRETE MATHEMATICS, 61. pp. 773-779. ISSN 1571-0653

Kovács, István and Soltész, Dániel (2018) Triangle-different Hamiltonian paths. JOURNAL OF COMBINATORIAL THEORY SERIES B, 129. pp. 1-17. ISSN 0095-8956

Kraiczy, Sonja and Cseh, Ágnes and Manlove, David (2023) On Weakly and Strongly Popular Rankings. DISCRETE APPLIED MATHEMATICS : THE JOURNAL OF COMBINATORIAL ALGORITHMS, INFORMATICS AND COMPUTATIONAL SCIENCES, 340. pp. 134-152. ISSN 0166-218X (print); 1872-6771 (online)

L

Lakshmanan, Aparna S. and Bujtás, Csilla and Tuza, Zsolt (2016) Induced cycles in triangle graphs. DISCRETE APPLIED MATHEMATICS, 209. pp. 264-275. ISSN 0166-218X

Lovász, László (2021) Flows on Measurable Spaces. GEOMETRIC AND FUNCTIONAL ANALYSIS. pp. 1-36. ISSN 1016-443X (print); 1420-8970 (online)

Lovász, László and T. Sós, Vera (2008) Generalized quasirandom graphs. JOURNAL OF COMBINATORIAL THEORY SERIES B, 98 (1). pp. 146-163. ISSN 0095-8956

Lv, Zequn and Győri, Ervin and He, Zhen and Salia, Nika and Xiao, Chuanqi and Zhu, Xiutao (2024) The Maximum Number of Cliques in Graphs with Bounded Odd Circumference. ANNALS OF COMBINATORICS, Publis. ISSN 0218-0006

Lyall, Neil and Magyar, Ákos (2020) Distance graphs and sets of positive upper density in Rd. ANALYSIS & PDE, 13 (3). pp. 685-700. ISSN 2157-5045

Lyall, Neil and Magyar, Ákos (2022) Weak hypergraph regularity and applications to geometric Ramsey theory. Transactions of the American Mathematical Society, Series B, 9 (5). pp. 160-207. ISSN 2330-0000

M

Mahmood, Badr Ali Doaa and Ghafil, Hazim and Jármai, Károly (2019) Optimizing Heuristic Graph Formation with Application in Kinematic Synthesis of a Robot Arm with Revolute Joints. JOURNAL OF ENGINEERING AND APPLIED SCIENCES, 14 (6). pp. 1976-1948. ISSN 1816-949X

Mubayi, Dhruv and T. Sós, Vera (2006) Explicit Constructions of Triple Systems For Ramsey-Turán Problems. JOURNAL OF GRAPH THEORY, 52 (3). pp. 211-216. ISSN 0364-9024

Mészáros, András (2020) The Distribution of Sandpile Groups of Random Regular Graphs. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY. pp. 1-67. ISSN 0002-9947 (print); 1088-6850 (online)

Mészáros, Gábor (2016) ON PATH-PAIRABILITY IN THE CARTESIAN PRODUCT OF GRAPHS. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 36 (3). pp. 743-758. ISSN 1234-3099

Mészáros, Gábor (2016) On linkedness in the Cartesian product of graphs. PERIODICA MATHEMATICA HUNGARICA, 72 (2). pp. 130-138. ISSN 0031-5303

Móri, Tamás F. and Rokob, Sándor (2019) Moments of general time dependent branching processes with applications. ACTA MATHEMATICA HUNGARICA, 159 (1). pp. 131-149. ISSN 0236-5294 (print); 1588-2632 (online)

Móri, Tamás F. and Rokob, Sándor (2019) Random cherry graphs. PUBLICATIONES MATHEMATICAE DEBRECEN, 95 (1-2). pp. 93-114. ISSN 0033-3883 (print); 2064-2849 (online)

N

Nagy, Zoltán Lóránt (2018) Coupon-Coloring and Total Domination in Hamiltonian Planar Triangulations. Graphs and Combinatorics. ISSN 0911-0119

Nagy, Zoltán Lóránt (2018) Saturating sets in projective planes and hypergraph covers. Discrete Mathematics, 341 (4). pp. 1078-1083. ISSN 0012365X

Nagy, Zoltán Lóránt (2019) Supersaturation of C4: From Zarankiewicz towards Erdős–Simonovits–Sidorenko. EUROPEAN JOURNAL OF COMBINATORICS, 75. pp. 19-31. ISSN 0195-6698

Nagy, Zoltán Lóránt and Blázsik, Zoltán L. (2019) SPREADING LINEAR TRIPLE SYSTEMSAND EXPANDER TRIPLE SYSTEMS. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 88 (3). pp. 977-984. ISSN 0862-9544

Naszódi, Márton and Pach, János and Swanepoel, Konrad J. (2018) Sphere-of-Influence Graphs in Normed Spaces. In: International Conference on Discrete Geometry and Symmetry, GeoSym 2015. Springer Proceedings in Mathematics & Statistics (234). Springer International Publishing, Cham, pp. 293-296. ISBN 978-3-319-78433-5

Németh, András and Tóth, Bence (2020) Gráf alapú integrált díjképzési rendszer hazai alkalmazási lehetőségei. In: Nemzetközi Közlekedéstudományi Konferencia 2020. Széchenyi István Egyetem, Közlekedési Tanszék, Győr, pp. 1-13. ISBN 9789638121899

O

Osztényi, József (2022) Studying the Multichromatic Number of the Almost S-Stable Kneser Graphs. GRADUS, 9 (1). pp. 1-5. ISSN 2064-8014

P

Pach, János (2014) Geometric intersection patterns and the theory of topological graphs. In: International Congress of Mathematicians (ICM 2014), 2014.08.13-2014.08.21, Seoul.

Pach, János (2016) Graphs with no grid obstacle representation. GEOMBINATORICS, XXVI (2). pp. 80-83. ISSN 1065-7371

Pach, János and Reed, B. and Yuditsky, Y. (2018) Almost all string graphs are intersection graphs of plane convex sets. In: 34th International Symposium on Computational Geometry, SoCG 2018. Leibniz International Proceedings in Informatics, LIPIcs (99). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 681-6814. ISBN 9783959770668

Pach, János and Rubin, Natan and Tardos, Gábor (2018) A Crossing Lemma for Jordan curves. ADVANCES IN MATHEMATICS, 331. pp. 908-940. ISSN 0001-8708

Pach, János and Székely, László A. and Tóth, Csaba D. and Tóth, Géza (2018) Note on k-planar crossing numbers. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 68. pp. 2-6. ISSN 0925-7721

Pach, János and Tardos, Gábor and Tóth, Géza (2022) Crossings between non-homotopic edges. JOURNAL OF COMBINATORIAL THEORY SERIES B, 156. pp. 389-404. ISSN 0095-8956

Pach, János and Tardos, Gábor and Tóth, Géza (2022) Disjointness Graphs of Short Polygonal Chains. In: 38th International Symposium on Computational Geometry (SoCG 2022). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 56. ISBN 9783959772273

Pach, János and Tardos, Gábor and Tóth, Géza (2017) Disjointness graphs of segments. In: 33rd International Symposium on Computational Geometry, SoCG 2017. Leibniz International Proceedings in Informatics, LIPIcs (77). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 591-5915. ISBN 9783959770385

Pach, János and Tardos, Gábor and Tóth, Géza (2024) Disjointness graphs of short polygonal chains. JOURNAL OF COMBINATORIAL THEORY SERIES B, 164. pp. 29-43. ISSN 0095-8956

Pach, János and Tóth, Géza (2018) A crossing Lemma for multigraphs. In: 34th International Symposium on Computational Geometry, SoCG 2018. Leibniz International Proceedings in Informatics, LIPIcs (99). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 651-6513. ISBN 9783959770668

Pach, Péter Pál and Vizer, Máté (2021) Improved lower bounds for multiplicative square-free sequences. JOURNAL OF COMBINATORIAL THEORY. ISSN 0021-9800 (Submitted)

Patkós, Balázs (2015) Supersaturation and stability for forbidden subposet problems. Journal of Combinatorial theory, Series A, 136. pp. 220-237.

Patkós, Balázs and Tuza, Zsolt and Vizer, Máté (2021) Vector sum-intersection theorems. EUROPEAN JOURNAL OF COMBINATORICS. ISSN 0195-6698 (Submitted)

Pongrácz, András (2018) Discordant voting protocols for cyclically linked agents. In: International Conference of Computer Science and Engineering, 2018. 07. 04-06., London.

Pongrácz, András (2020) Discordant voting protocols for cyclically linked agents. ELECTRONIC JOURNAL OF COMBINATORICS, 27 (1). ISSN 1077-8926

R

Rajna, Franciska (2021) A kommunikációs gráfok és a fekete-fehér SAT probléma közti összefüggések vizsgálata. In: Agria Média 2020. Eszterházy Károly Egyetem Líceum Kiadó, Eger, pp. 321-330.

Recski, Gábor András (2016) Building Concept Graphs from Monolingual Dictionary Entries. In: Proceedings of the Tenth International Conference on Language Resources and Evaluation (LREC 2016). European Language Resources Association (ELRA), Portoroz, pp. 2620-2624. ISBN 978-2-9517408-9-1

Rostás, László and Kovács, László (2019) Mondat függőségi gráfok ontológiai modellezése. MULTIDISZCIPLINÁRIS TUDOMÁNYOK: A MISKOLCI EGYETEM KÖZLEMÉNYE, 9 (1). pp. 106-115. ISSN 2062-9737

Rozman, Kati and Ghysels, An and Zaválnij, Bogdán and Kunej, Tanja and Bren, Urban and Janežič, Dušanka and Konc, Janez (2024) Enhanced Molecular Docking: Novel Algorithm for Identifying Highest Weight k-Cliques in Weighted General and Protein-Ligand Graphs. JOURNAL OF MOLECULAR STRUCTURE, 1304. No.-137639. ISSN 0022-2860

Ruszinkó, Miklós and Song, Lang and Szabó, Dániel P. (2019) Monochromatic Diameter Two Components in Edge Colorings of the Complete Graph. INVOLVE: A JOURNAL OF MATHEMATICS. pp. 1-7. ISSN 1944-4176 (print); 1944-4184 (online)

Ráth, Balázs and Crane, Edward and Yeo, Dominic (2021) Age evolution in the mean field forest fire model via multitype branching processes. ANNALS OF PROBABILITY, 49 (4). pp. 2031-2075. ISSN 0091-1798

Ráth, Balázs and Swart, Jan and Terpai, Tamás (2019) Frozen percolation on the binary tree is nonendogenous. ANNALS OF PROBABILITY. ISSN 0091-1798 (In Press)

S

Sali, Attila and Simonyi, Gábor and Tardos, Gábor (2020) Partitioning Transitive Tournaments into Isomorphic Digraphs. ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS. pp. 1-17. ISSN 0167-8094 (print); 1572-9273 (online)

Semeráth, Oszkár and Varró, Dániel (2017) Evaluating Well-Formedness Constraints on Incomplete Models. ACTA CYBERNETICA-SZEGED. pp. 1-26. ISSN 0324-721X

Semeráth, Oszkár and Varró, Dániel (2017) Graph Constraint Evaluation over Partial Models by Constraint Rewriting. In: Proceedings of the 10th International Conference on Model Transformation, 2017.07.17-2017.07.18, Marburg.

Simonovits, Miklós (2018) Extremal Graph Theory, Stability, and Anti-Ramsey Theorems. In: Algorithms and discrete applied mathematics : 4th international conference, CALDAM 2018. Lecture notes in computer science (10743). Springer. ISBN 9783319741802 ; 9783319741796

Simonovits, Miklós and T. Sós, Vera (2003) Hereditary extended properties, quasi-random graphs and induced subgraphs. COMBINATORICS PROBABILITY AND COMPUTING, 12 (3). pp. 319-344. ISSN 0963-5483

Simonovits, Miklós and T. Sós, Vera (2005) A hierarchy of randomness for graphs. DISCRETE MATHEMATICS, 303 (1-3). pp. 209-233. ISSN 0012-365X

Simonyi, Gábor (2020) On colorful edge triples in edge-colored complete graphs. GRAPHS AND COMBINATORICS, 36. pp. 1623-1637. ISSN 0911-0119

Simonyi, Gábor and Tardos, Gábor (2020) On 4-Chromatic Schrijver Graphs: Their Structure, Non-3-Colorability, and Critical Edges : A Story with Drums. ACTA MATHEMATICA HUNGARICA, 161. pp. 583-617. ISSN 0236-5294 (print); 1588-2632 (online)

Szabó, György and Borsos, István and Szombati, Edit (2019) Games, graphs and Kirchhoff laws. PHYSICA A - STATISTICAL MECHANICS AND ITS APPLICATIONS, 521. pp. 416-423. ISSN 0378-4371

Szabó, Sándor and Zavalnij, Bogdan (2018) Decomposing clique search problems into smaller instances based on node and edge colorings. DISCRETE APPLIED MATHEMATICS, 242. pp. 118-129. ISSN 0166-218X

Szabó, Sándor and Zavalnij, Bogdan (2019) Reducing hypergraph coloring to clique search. DISCRETE APPLIED MATHEMATICS, 264. pp. 196-207. ISSN 0166-218X

Szabó, Sándor and Zaválnij, Bogdán (2019) Benchmark Problems for Exhaustive Exact Maximum Clique Search Algorithms. Informatica : An International Journal of Computing and Informatics, 43 (2). pp. 177-186. ISSN 0350-5596

Szabó, Sándor and Zaválnij, Bogdán (2022) Parallelizing zero-one linear programs using graph theoretical considerations. In: Short papers of VOCAL 2022 (9th VOCAL Optimization Conference: Advanced Algorithms). Hungarian Operations Research Society, Budapest, pp. 54-59. ISBN 9786150159874

Sziklai, Balázs and Fleiner, Tamás and Solymosi, Tamás (2016) On the core and nucleolus of directed acyclic graph games. MATHEMATICAL PROGRAMMING. pp. 1-29. ISSN 0025-5610

Szilágyi, László and Nagy, Lajos Loránd and Szilágyi, Sándor Miklós (2015) Recent Advances in Improving the Memory Efficiency of the TRIBE MCL Algorithm. In: International Conference on Neural Information Processing - ICONIP2015, 9-12 Nov 2015, Istanbul, Turkey.

Szilágyi, László and Szilágyi, Sándor Miklós (2016) A modified two-stage Markov clustering algorithm for large and sparse networks. Computer Methods and Programs in Biomedicine, 135. pp. 15-26. ISSN 0169-2607

Sárközy, Gábor and Gyárfás, András (2016) Ramsey number of a connected triangle matching. JOURNAL OF GRAPH THEORY, 83 (2). pp. 109-119. ISSN 0364-9024

T

T. Sós, Vera (1970) On extremal problems in graph theory. In: Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta., 1969). Gordon and Breach, Calgary.

T. Sós, Vera and Straus, E. G. (1982) Extremals of Functions on Graphs with Applications to Graphs and Hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES B, 32 (3). pp. 246-257. ISSN 0095-8956

Tardos, Gábor (2018) Extremal theory of ordered graphs. In: Proceedings of the International Congress of Mathematicians, Rio de Janeiro 2018 : Volume IV.: Invited Lectures. Proceedings of the International Congress of Mathematicians (4). World Scientific Publishing Co Pte Ltd, Singapore, pp. 3253-3262. ISBN 978-981-3272-93-4 (volume print); 978-981-3272-87-3 (set print); 978-981-3272-88-0 (online)

Timár, Ádám and Tóth, László Márton (2024) A Full Characterization of Invariant Embeddability of Unimodular Planar Graphs. RANDOM STRUCTURES & ALGORITHMS, 64 (2). pp. 320-353. ISSN 1042-9832 (print); 1098-2418 (online)

Tuza, Zsolt (2017) Graph labeling games. ELECTRONIC NOTES IN DISCRETE MATHEMATICS, 60. pp. 61-68. ISSN 1571-0653

Tóth, Bence (2019) Forgalmatlan, de nélkülözhetetlen - a magyarországi vasúthálózat redundanciavizsgálata. In: Közlekedéstudományi Konferencia : Technika és technológia a fenntartható közlekedés szolgálatában. Széchenyi István Egyetem Közlekedési Tanszék, Győr, pp. 1-9.

Tóth, Bence (2023) Állomásközök és térközök hatása a vasúthálózat modelljének pontosságára. HADTUDOMÁNY: A MAGYAR HADTUDOMÁNYI TÁRSASÁG FOLYÓIRATA, 33 (E). pp. 137-156. ISSN 1215-4121

Tóth, Bence (2018) A magyarországi vasúthálózat zavarainak gráfelméleti alapú vizsgálata. In: Közlekedéstudományi Konferencia: Technika és technológia a fenntartható közlekedés szolgálatában. Széchenyi István Egyetem, Közlekedési Tanszék, Győr, pp. 505-519. ISBN 978-615-5776-13-7

Túri, József (2021) Some Remarks of Random Graphs. MULTIDISZCIPLINÁRIS TUDOMÁNYOK, 11 (5). pp. 251-255. ISSN 2786-1465

U

Ujhelyi, Zoltán and Bergmann, Gábor and Varró, Dániel (2016) Rete Network Slicing for Model Queries. In: Graph Transformation : 9th International Conference, ICGT 2016, in Memory of Hartmut Ehrig, Held as Part of STAF 2016, Vienna, Austria, July 5-6, 2016, Proceedings. Lecture Notes in Computer Science (9761). Springer International Publishing, Cham (Németország), pp. 137-152. ISBN 978-3-319-40530-8

V

Vass, Balázs and Bérczi-Kovács, Erika R. and Fraknói, Ádám and Raiciu, Costin and Rétvári, Gábor (2024) Charting the Complexity Landscape of Compiling Packet Programs to Reconfigurable Switches. IEEE/ACM Transactions on Networking. pp. 1-16. ISSN 1063-6692

Vizer, Máté and Balko, Martin (2019) EDGE-ORDERED RAMSEY NUMBERS. ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 88 (3). pp. 409-414. ISSN 0862-9544

W

Wiener, Gábor (2016) Depth first search in claw-free graphs. In: JCDCGGG 2016, Tokió.

Wiener, Gábor (2016) Leaf-critical and leaf-stable graphs. Journal of Graph Theory. ISSN 0364-9024

Wiener, Gábor (2016) On constructions of hypotraceable graphs. ELECTRONIC NOTES IN DISCRETE MATHEMATICS. ISSN 1571-0653 (In Press)

Wiener, Gábor (2016) On non-traceable, non-hypotraceable, arachnoid graphs. ELECTRONIC NOTES IN DISCRETE MATHEMATICS, 49. pp. 621-627. ISSN 1571-0653

X

Xiao, Chuanqi and Katona, Gyula O. H. and Xiao, Jimeng and Zamora, Oscar (2022) The Turán Number of the Square of a Path. DISCRETE APPLIED MATHEMATICS : THE JOURNAL OF COMBINATORIAL ALGORITHMS, INFORMATICS AND COMPUTATIONAL SCIENCES, 307. pp. 1-14. ISSN 0166-218X (print); 1872-6771 (online)

Z

Zhang, Fangfang and Chen, Yaojun and Győri, Ervin and Zhu, Xiutao (2024) Maximum cliques in a graph without disjoint given subgraph. DISCRETE MATHEMATICS, 347 (4). ISSN 0012-365X

Á

Ábele-Nagy, Kristóf and Bozóki, Sándor and Rebák, Örs (2018) Efficiency analysis of double perturbed pairwise comparison matrices. Journal of the Operational Research Society, 69 (5). pp. 707-713. ISSN 0160-5682

Ács, Bernadett and Szederkényi, Gábor and Tuza, Zoltán András and Tuza, Zsolt (2015) Computing Linearly Conjugate Weakly Reversible Kinetic Structures Using Optimization and Graph Theory. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 74 (3). pp. 481-504. ISSN 0340-6253

Ó

Ódor, Gergely and Czifra, Domonkos and Komjáthy, Júlia and Lovász, László and Karsai, Márton (2021) Longer-Term Seeding Effects on Epidemic Processes: A Network Approach = A korai fertőzések helyzetének hosszú távú hatásai a járványterjedésre: egy hálózati megközelítés. SCIENTIA ET SECURITAS, 2 (4). pp. 409-417. ISSN 2732-2688