From Geometry to Combinatorics and Back: Escaping the Curse of Dimensionality

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Ruzsa’s Problem on Bi-Sidon Sets

Author(s): János Pach, Dmitrii Zakharov
Published in: Combinatorica, Issue 45, 2025, Page(s) article number 26, ISSN 0209-9683
Publisher: Springer Verlag
DOI: 10.1007/s00493-025-00151-5

Corrigendum to “An algorithm to find maximum area polygons circumscribed about a convex polygon” [Discrete Appl. Math. 255 (2019) 98–108]

Author(s): Markus Ausserhofer, Susanna Dann, Zsolt Lángi, Géza Tóth
Published in: Discrete Applied Mathematics, Issue 353, 2024, Page(s) 222-226, ISSN 0166-218X
Publisher: Elsevier BV
DOI: 10.1016/j.dam.2024.04.013

Crossings between non-homotopic edges

Author(s): János Pach; Gábor Tardos; Géza Tóth
Published in: JCTB, Issue Volume 156, September 2022, 2022, Page(s) 389-404, ISSN 0095-8956
Publisher: Academic Press
DOI: 10.1016/j.jctb.2022.05.007

On the hollow enclosed by convex sets

Author(s): Jenő Lehet, Géza Tóth
Published in: Geombinatorics, Issue XXX, 2021, Page(s) 113-122, ISSN 1065-7371
Publisher: University of Colorado

A note on Borsuk's problem in Minkowski spaces

Author(s): A.M. Raigorodskii, A. Sagdeev
Published in: Doklady Mathematics, Issue Vol. 109, 2024, Page(s) 80-83, ISSN 1064-5624
Publisher: Maik Nauka/Interperiodica Publishing
DOI: 10.1134/s1064562424701849

On the number of A-transversals in hypergraphs

Author(s): János Barát, Dániel Gerbner, Anastasia Halfpap
Published in: Periodica Mathematica Hungarica, Issue 89, 2024, Page(s) 107-115, ISSN 0031-5303
Publisher: Akademiai Kiado
DOI: 10.1007/s10998-024-00586-1

On Some Non-Rigid Unit Distance Patterns

Author(s): N. Frankl, D. Woodruff
Published in: Discrete Comput Geom, Issue 14 July 2023, 2023, ISSN 0179-5376
Publisher: Springer Verlag
DOI: 10.1007/s00454-023-00503-2

Peeling Sequences

Author(s): Adrian Dumitrescu; Géza Tóth
Published in: Discrete Comput Geom, 2024, ISSN 0179-5376
Publisher: Springer Verlag
DOI: 10.1007/s00454-023-00616-8

The complexity of recognizing $ABAB$-free hypergraphs

Author(s): Gábor Damásdi, Balázs Keszegh, Dömötör Pálvölgyi, Karamjeet Singh
Published in: Discrete Mathematics & Theoretical Computer Science, Issue vol. 27:1, Permutation..., 2025, Page(s) 1-11, ISSN 1365-8050
Publisher: Maison de l'informatique et des mathematiques discretes
DOI: 10.46298/dmtcs.14610

Estimates on the decay of the Laplace–Pólya integral

Author(s): Gergely Ambrus, Barnabás Gárgyán
Published in: Bulletin of the London Mathematical Society, Issue 2025, 2025, Page(s) 1-20, ISSN 0024-6093
Publisher: Oxford University Press
DOI: 10.1112/blms.70157

Quasiplanar graphs, string graphs, and the Erdős–Gallai problem

Author(s): Jacob Fox, János Pach, Andrew Suk
Published in: European Journal of Combinatorics, Issue 119, 2024, Page(s) 103811, ISSN 0195-6698
Publisher: Academic Press
DOI: 10.1016/j.ejc.2023.103811

The density of planar sets avoiding unit distances

Author(s): Gergely Ambrus; Adrián Csiszárik; Máté Matolcsi; Dániel Varga; Pál Zsámboki
Published in: Math. Program., Issue 06 October 2023, 2023, ISSN 0025-5610
Publisher: Springer Verlag
DOI: 10.1007/s10107-023-02012-9

Rainbow Even Cycles

Author(s): Zichao Dong, Zijian Xu
Published in: SIAM Journal on Discrete Mathematics, Issue 38, 2024, Page(s) 1269-1284, ISSN 0895-4801
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/23m1564808

Radial projection theorems in finite spaces

Author(s): Ben Lund, Thang Pham, Vu Thu
Published in: Proceedings of the American Mathematical Society, Issue 153 (2025), 2025, Page(s) 2169-2183, ISSN 0002-9939
Publisher: American Mathematical Society
DOI: 10.1090/proc/17195

Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph

Author(s): Biró, Csaba; Lehel, Jenő; Tóth, Géza
Published in: Order, Issue 40, 2023, Page(s) 665–682, ISSN 0167-8094
Publisher: Kluwer Academic Publishers
DOI: 10.1007/s11083-023-09625-x

Maximal line-free sets in $$\mathbb {F}_p^n$$

Author(s): Christian Elsholtz, Jakob Führer, Erik Füredi, Benedek Kovács, Péter Pál Pach, Dániel Gábor Simon, Nóra Velich
Published in: Periodica Mathematica Hungarica, 2025, ISSN 0031-5303
Publisher: Akademiai Kiado
DOI: 10.1007/s10998-024-00617-x

On the sequence $n! \bmod p$

Author(s): Alexandr Grebennikov, Arsenii Sagdeev, Aliaksei Semchankau, Aliaksei Vasilevskii
Published in: Revista Matemática Iberoamericana, Issue 40, 2025, Page(s) 637-648, ISSN 0213-2230
Publisher: Universidad Autonoma de Madrid
DOI: 10.4171/rmi/1422

Odd-distance and right-equidistant sets in the maximum and Manhattan metrics

Author(s): Alexander Golovanov, Andrey Kupavskii, Arsenii Sagdeev
Published in: European Journal of Combinatorics, Issue 107, 2023, ISSN 0195-6698
Publisher: Academic Press
DOI: 10.1016/j.ejc.2022.103603

On the Rényi–Ulam game with restricted size queries

Author(s): Ádám Fraknói, Dávid Márton, Dániel Simon, Dániel Lenger.
Published in: Discrete Optimization, Issue Volume 48, Part 1, May 2023, 2023, ISSN 1572-5286
Publisher: Elsevier BV
DOI: 10.1016/j.disopt.2023.100772

Disjointness graphs of short polygonal chains

Author(s): János Pach; Gábor Tardos; Géza Tóth
Published in: JCTB, Issue 164, 2024, Page(s) 29-43, ISSN 0095-8956
Publisher: Academic Press
DOI: 10.1016/j.jctb.2023.08.008

Monochromatic spanning trees and matchings in ordered complete graphs

Author(s): János Barát; András Gyárfás; Géza Tóth
Published in: J. Graph Theory, Issue 105 (4), 2024, Page(s) 523-541, ISSN 0364-9024
Publisher: John Wiley & Sons Inc.
DOI: 10.1002/jgt.23058

Random Necklaces Require Fewer Cuts

Author(s): Noga Alon, Dor Elboim, János Pach, Gábor Tardos
Published in: SIAM Journal on Discrete Mathematics, Issue 38, 2024, Page(s) 1381-1408, ISSN 0895-4801
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/22m1506699

Convergence and Limits of Finite Trees

Author(s): Gábor Elek, Gábor Tardos
Published in: Combinatorica, Issue 15 November 2021, 2021, ISSN 0209-9683
Publisher: Springer Verlag
DOI: 10.1007/s00493-021-4445-5

Eight-Partitioning Points in 3D, and Efficiently Too

Author(s): Boris Aronov, Abdul Basit, Indu Ramesh, Gianluca Tasinato, Uli Wagner
Published in: Discrete & Computational Geometry, 2025, Page(s) 25, ISSN 0179-5376
Publisher: Springer Verlag
DOI: 10.1007/s00454-025-00739-0

Non-diagonal critical central sections of the cube

Author(s): Ambrus, Gergely; Gárgyán, Barnabás
Published in: Advances in Mathematics, Issue 441, 2024, Page(s) 109524, ISSN 0001-8708
Publisher: Academic Press
DOI: 10.1016/j.aim.2024.109524

Exploring Mazes at Random

Author(s): Nikita Gladkov, Igor Pak
Published in: The Mathematical Intelligencer, 2025, ISSN 0343-6993
Publisher: Springer Verlag
DOI: 10.1007/s00283-025-10439-5

Optimal Embedded and Enclosing Isosceles Triangles

Author(s): Áron Ambrus, Mónika Csikós, Gergely Kiss, János Pach, Gábor Somlai
Published in: International Journal of Foundations of Computer Science, Issue 34, 2023, Page(s) 737-760, ISSN 0129-0541
Publisher: World Scientific Publishing Co
DOI: 10.1142/s012905412342008x

Note on disjoint faces in simple topological graphs

Author(s): Ji Zeng
Published in: Journal of Combinatorial Theory, Series B, Issue 171, 2024, Page(s) 28-35, ISSN 0095-8956
Publisher: Academic Press
DOI: 10.1016/j.jctb.2024.11.002

On the Number of Digons in Arrangements of Pairwise Intersecting Circles

Author(s): Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay
Published in: Combinatorica, Issue 45, 2025, Page(s) article number 30, ISSN 0209-9683
Publisher: Springer Verlag
DOI: 10.1007/s00493-025-00139-1

Exchange Properties of Finite Set-Systems

Author(s): P. Frankl, J. Pach, D.Pálvölgyi
Published in: SIAM J. Disc. Math., Issue 36:3, 2022, Page(s) 2073-2081, ISSN 0895-4801
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/21m145149x

Two-colorings of normed spaces without long monochromatic unit arithmetic progressions

Author(s): V. Kirova, A. Sagdeev
Published in: SIAM J. Disc. Math., Issue 37 (2), 2023, Page(s) 718-732, ISSN 0895-4801
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/22m1483700

Almost-Monochromatic Sets and the Chromatic Number of the Plane

Author(s): N. Frankl, T. Hubai, D. Pálvölgyi
Published in: Discrete Computational Geometry, Issue 113, 2023, ISSN 0179-5376
Publisher: Springer Verlag
DOI: 10.1007/s00454-023-00526-9

The Minimum Number of Peeling Sequences of a Point Set

Author(s): Dániel G. Simon
Published in: Discrete & Computational Geometry, 2025, ISSN 0179-5376
Publisher: Springer Verlag
DOI: 10.1007/s00454-024-00713-2

Bounded VC-Dimension Implies the Schur-Erdős Conjecture

Author(s): Jacob Fox, János Pach, Andrew Suk
Published in: Combinatorica, Issue 41, 2021, Page(s) 803-813, ISSN 0209-9683
Publisher: Springer Verlag
DOI: 10.1007/s00493-021-4530-9

SOLUTION TO A CONJECTURE OF SCHMIDT AND TULLERON ONE-DIMENSIONAL PACKINGS AND COVERINGS

Author(s): Nóra Frankl, Andrey Kupavskii, Arsenii Sagdeev
Published in: Proceedings of the American Mathematical Society, Issue Volume 151, Number 6, 2023, Page(s) 2353-2362, ISSN 0002-9939
Publisher: American Mathematical Society
DOI: 10.1090/proc/16254

Quantitative Steinitz theorem: a spherical version

Author(s): Grigory Ivanov, Márton Naszódi
Published in: Boletín de la Sociedad Matemática Mexicana, Issue 31, 2025, ISSN 1405-213X
Publisher: Birkhauser Verlag
DOI: 10.1007/s40590-025-00717-9

The double Hall property and cycle covers in bipartite graphs

Author(s): János Barát, Andrzej Grzesik, Attila Jung, Zoltán Lóránt Nagy, Dömötör Pálvölgyi
Published in: Discrete Mathematics, Issue 347, 2024, Page(s) 114079, ISSN 0012-365X
Publisher: Elsevier BV
DOI: 10.1016/j.disc.2024.114079

Colorful vector balancing

Author(s): Gergely Ambrus, Rainie Bozzai
Published in: Mathematika, Issue 70, 2024, Page(s) 1-24, ISSN 0025-5793
Publisher: University College London, Department of Mathematics
DOI: 10.1112/mtk.12274

Nearly k-distance sets

Author(s): N. Frankl, A. Kupavskii
Published in: Discrete Comput Geom, Issue 382, 2023, Page(s) 40, ISSN 0179-5376
Publisher: Springer Verlag
DOI: 10.1007/s00454-023-00489-x

General penny graphs are at most-dense

Author(s): Arsenii Sagdeev
Published in: Combinatorics and Number Theory, Issue 14, 2025, Page(s) 75-89, ISSN 2996-220X
Publisher: Mathematical Sciences Publishers
DOI: 10.2140/cnt.2025.14.75

General sharp upper bounds on the total coalition number

Author(s): János Barát, Zoltán Blázsik
Published in: Discussiones Mathematicae Graph Theory, Issue 44, 2024, Page(s) 1567, ISSN 1234-3099
Publisher: Technical University Press
DOI: 10.7151/dmgt.2511

Extremal K4-minor-free graphs without short cycles

Author(s): János Barát
Published in: Periodica Mathematica Hungarica, Issue 86, 2023, Page(s) 108-114, ISSN 0031-5303
Publisher: Akademiai Kiado
DOI: 10.1007/s10998-022-00465-7

Monochromatic triangles in the max-norm plane

Author(s): A. Natalchenko, A. Sagdeev
Published in: European Journal of Combinatorics, Issue Vol. 120, 2024, Page(s) 103977, ISSN 0195-6698
Publisher: Academic Press
DOI: 10.1016/j.ejc.2024.103977

On Well-Connected Sets of Strings

Author(s): Péter Frankl, János Pach
Published in: The Electronic Journal of Combinatorics, Issue Vol 29, Issue 1, 2022, Page(s) 1-6, ISSN 1077-8926
Publisher: Electronic Journal of Combinatorics
DOI: 10.37236/10291

Weight balancing on boundaries

Author(s): Barba, L.; Cheong, O.; Dobbins, M. G.; Fleischer, R.; Kawamura, A.; Korman, M.; Okamoto, Y.; Pach, J.; Tang, Y.; Takeshi Tokuyama; Verdonschot, S.
Published in: Journal of Computational Geometry, Issue Volume 13, Issue 1, 2022, Page(s) 1 - 12, ISSN 1920-180X
Publisher: Elsevier
DOI: 10.20382/jocg.v13i1a1

On the number of edges in a K5-minor-free graph of given girth

Author(s): János Barát
Published in: Discrete Mathematics, Issue 347, 2024, Page(s) 114042, ISSN 0012-365X
Publisher: Elsevier BV
DOI: 10.1016/j.disc.2024.114042

Piercing the chessboard

Author(s): G. Ambrus, I. Bárány, P. Frankl, D. Varga
Published in: SIDMA, Issue 37(3), 2023, ISSN 0895-4801
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/21m146048x

Planar point sets determine many pairwise crossing segments

Author(s): János Pach, Natan Rubin, Gábor Tardos
Published in: Advances in Mathematics, Issue Volume 386, 6 August 2021, 2021, ISSN 0001-8708
Publisher: Academic Press
DOI: 10.1016/j.aim.2021.107779

On Cliques in Three-Dimensional Dense Point-Line Arrangements

Author(s): Andrew Suk, Ji Zeng
Published in: SIAM Journal on Discrete Mathematics, Issue 38, 2024, Page(s) 2971-2981, ISSN 0895-4801
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/23m161879x

On Helly numbers of exponential lattices

Author(s): Ambrus, Gergely; Balko, Martin; Frankl, Nóra; Jung, Attila; Naszódi, Márton
Published in: Europ. J. Combin., 2024, ISSN 0195-6698
Publisher: Academic Press
DOI: 10.1016/j.ejc.2023.103884

VC-saturated set systems

Author(s): Nóra Frankl, Sergei Kiselev, Andrey Kupavskii, Balázs Patkós
Published in: European Journal of Combinatorics, Issue Volume 104, 2023, ISSN 0195-6698
Publisher: Academic Press
DOI: 10.1016/j.ejc.2022.103528

Random Turán and counting results for general position sets over finite fields

Author(s): Yaobin Chen, Xizhi Liu, Jiaxi Nie, Ji Zeng
Published in: Science China Mathematics, 2025, ISSN 1674-7283
Publisher: Zhongguo Kexue Zazhishe/Science in China Press
DOI: 10.1007/s11425-024-2384-x

Odd-Ramsey numbers of complete bipartite graphs

Author(s): Simona Boyadzhiyska, Shagnik Das, Thomas Lesgourgues, Kalina Petrova
Published in: European Journal of Combinatorics, Issue 131, 2025, Page(s) 104235, ISSN 0195-6698
Publisher: Academic Press
DOI: 10.1016/j.ejc.2025.104235

Max-norm Ramsey theory

Author(s): Frankl, Nóra; Kupavskii, Andrey; Sagdeev, Arsenii
Published in: Europ. J. Combin., Issue 118, 2024, Page(s) 103918, ISSN 0195-6698
Publisher: Academic Press
DOI: 10.1016/j.ejc.2024.103918

Turán problems for edge-ordered graphs

Author(s): Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Gábor Tardos, Máté Vizer
Published in: Journal of Combinatorial Theory, Series B, Issue Volume 160, 2023, Page(s) 66-113, ISSN 0095-8956
Publisher: Academic Press
DOI: 10.1016/j.jctb.2022.12.006

The number of crossings in multigraphs with no empty lens

Author(s): Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
Published in: Journal of Graph Algorithms and Applications, Issue 25/1, 2021, Page(s) 383-396, ISSN 1526-1719
Publisher: Brown University
DOI: 10.7155/jgaa.00563

Sunflowers in Set Systems of Bounded Dimension

Author(s): J. Fox, J. Pach, A. Suk
Published in: Combinatorica, Issue 43, 2023, Page(s) 187-202, ISSN 0209-9683
Publisher: Springer Verlag
DOI: 10.1007/s00493-023-00012-z

Monochromatic Infinite Sets in Minkowski Planes

Author(s): Nóra Frankl, Panna Gehér, Arsenii Sagdeev, Géza Tóth
Published in: Discrete & Computational Geometry, 2024, ISSN 0179-5376
Publisher: Springer Verlag
DOI: 10.1007/s00454-024-00702-5

Improved upper bound on the Frank number of 3-edge-connected graphs

Author(s): János Barát, Zoltán L. Blázsik
Published in: European Journal of Combinatorics, Issue 118, 2024, Page(s) 103913, ISSN 0195-6698
Publisher: Academic Press
DOI: 10.1016/j.ejc.2023.103913

Crossing lemma for the odd-crossing number

Author(s): János Karl, Géza Tóth
Published in: Computational Geometry, Issue Volume 108, January 2023, 2023, ISSN 0925-7721
Publisher: Elsevier BV
DOI: 10.1016/j.comgeo.2022.101901

1-planar unit distance graphs

Author(s): Panna Gehér, Géza Tóth
Published in: LIPICS, Issue 320, 2024, Page(s) 6:1-6:9, ISSN 1868-8969
Publisher: The Dagstuhl Research Online Publication Server

Progressions in Euclidean Ramsey theory

Author(s): Jakob Führer, Géza Tóth
Published in: European Journal of Combinatorics, Issue 125, 2025, Page(s) 104105, ISSN 0195-6698
Publisher: Academic Press
DOI: 10.1016/j.ejc.2024.104105

Shattered matchings in intersecting hypergraphs

Author(s): Péter Frankl, János Pach
Published in: Moscow Journal of Combinatorics and Number Theory, Issue Vol. 10, 2021, Page(s) 49-59, ISSN 2640-7361
Publisher: Moscow Institute of Technology
DOI: 10.2140/moscow.2021.10.49

Saturated 2-plane drawings with few edges

Author(s): J. Barát, G. Tóth
Published in: ARS MATHEMATICA CONTEMPORANEA, Issue 24:1, 2024, Page(s) 1-8., ISSN 1855-3966
Publisher: DMFA Slovenije
DOI: 10.26493/1855-3974.2805.b49

Disjointness graphs of segments in the space

Author(s): János Pach, Gábor Tardos, Géza Tóth
Published in: Combinatorics, Probability and Computing, Issue 30/4, 2021, Page(s) 498-512, ISSN 0963-5483
Publisher: Cambridge University Press
DOI: 10.1017/s0963548320000504

Erdős-Hajnal-type results for monotone paths

Author(s): János Pach, István Tomon
Published in: Journal of Combinatorial Theory, Series B, Issue 151, 2021, Page(s) 21-37, ISSN 0095-8956
Publisher: Academic Press
DOI: 10.1016/j.jctb.2021.05.004

Crumby colorings — red-blue vertex partition of subcubicgraphs regarding a conjecture of Thomassen

Author(s): János Barát, Zoltán L. Blázsik, Gábor Damásdi
Published in: Discrete Mathematics, Issue 346:4, 2023, ISSN 0012-365X
Publisher: Elsevier BV
DOI: 10.1016/j.disc.2022.113281

Successive vertex orderings of fully regular graphs

Author(s): L. Fang, H, Huang, J. Pach, G. Tardos, J. Zuo
Published in: JCTA, Issue 199, 2023, ISSN 0097-3165
Publisher: Academic Press
DOI: 10.1016/j.jcta.2023.105776

Odd-sunflowers

Author(s): Peter Frankl, János Pach, Dömötör Pálvölgyi
Published in: Journal of Combinatorial Theory, Series A, Issue 206, 2024, Page(s) 105889, ISSN 0097-3165
Publisher: Academic Press
DOI: 10.1016/j.jcta.2024.105889

Maximum Betti Numbers of Čech Complexes

Author(s): Herbert Edelsbrunner, Janos Pach
Published in: 40th International Symposium on Computational Geometry (SoCG 2024), Issue 293, 2024, Page(s) 53:1-53:14, ISBN 978-3-95977-316-4
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.socg.2024.53

A Structure Theorem for Pseudo-Segments and Its Applications

Author(s): Jacob Fox, János Pach, Andrew Suk
Published in: 40th International Symposium on Computational Geometry (SoCG 2024), Issue 293, 2024, Page(s) 59:1-59:14, ISBN 978-3-95977-316-4
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.socg.2024.59

Odd-Sunflowers

Author(s): P. Frankl, J. Pach, D. Pálvölgyi
Published in: Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications EUROCOMB’23, 2023, Page(s) 441-449, ISSN 2788-3116
Publisher: Munipress
DOI: 10.5817/cz.muni.eurocomb23-061

Monochromatic configurations on a circle

Author(s): G. Damásdi, N. Frankl, D. Pálvölgyi, J. Pach
Published in: Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications EUROCOMB’23, 2023, Page(s) 320-327, ISSN 2788-3116
Publisher: Munipress
DOI: 10.5817/cz.muni.eurocomb23-044

Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs

Author(s): Adrian Dumitrescu, Janos Pach
Published in: 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024), Issue 320, 2024, Page(s) 9:1-9:10, ISBN 978-3-95977-343-0
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.gd.2024.9

Disjointness Graphs of Short Polygonal Chains

Author(s): János Pach, Gábor Tardos, Géza Tóth
Published in: 38th International Symposium on Computational Geometry, Issue LIPICS Vol. 224, 2022, Page(s) 56:1-56:12, ISBN 978-3-95977-227-3
Publisher: Dagstuhl Publishing
DOI: 10.4230/lipics.socg.2022.56

Sunflowers in Set Systems of Bounded Dimension

Author(s): Jacob Fox, János Pach, Andrew Suk
Published in: Leibniz International Proceedings in Informatics, 2021, ISBN 978-3-95977-184-9
Publisher: Schloss Dagstuhl
DOI: 10.4230/lipics.socg.2021.37

Decomposition of Geometric Graphs into Star-Forests

Author(s): János Pach; Morteza Saghafian; Patrick Schnider
Published in: Graph Drawing and Network Visualization: 31st International Symposium, GD 2023, 2023, Page(s) 339–346, ISBN 978-3-031-49271-6
Publisher: Springer-Verlag
DOI: 10.1007/978-3-031-49272-3_23

Enumeration of Intersection Graphs of x-Monotone Curves

Author(s): Jacob Fox, János Pach, Andrew Suk
Published in: 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024), Issue 320, 2024, Page(s) 4:1-4:12, ISBN 978-3-95977-343-0
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.gd.2024.4

On Helly Numbers of Exponential Lattices

Author(s): G. Ambrus, M. Balko, N. Frankl, A. Jung, M. Naszódi
Published in: 39th International Symposium on Computational Geometry (SoCG 2023), Issue 258, 2023, Page(s) 8:1--8:16, ISBN 978-3-95977-273-0
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.socg.2023.8

On the Number of Edges of Separated Multigraphs

Author(s): Jacob Fox, János Pach, Andrew Suk
Published in: Lecture Notes in Computer Science, Issue 2021, 2021, Page(s) 223-227, ISBN 978-3-030-92931-2
Publisher: Springer
DOI: 10.1007/978-3-030-92931-2_16

On the generalized Myczielskian of complements of odd cycles

Author(s): A. Gujgiczer, G. Simonyi, G. Tardos
Published in: Proceedings of the 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, 2023, Page(s) 485-488, ISBN 978-963-421-903-3
Publisher: Budapest University of Technology and Economics

Saturation results around the Erdős--Szekeres problem

Author(s): Damásdi, Gábor; Dong, Zichao; Scheucher, Manfred; Zeng, Ji
Published in: 40th International Symposium on Computational Geometry (SoCG 2024), Issue 2, 2024, ISBN 978-3-95977-316-4
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.socg.2024.46

Quasiplanar graphs, string graphs, and the Erd ̋os-Gallai problem

Author(s): Jacob Fox, János Pach, Andrew Suk
Published in: Lecture Notes in Computer Science, Issue vol 13764., 2023, ISBN 978-3-031-22202-0
Publisher: Springer
DOI: 10.1007/978-3-031-22203-0_16

Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs

Author(s): Péter Ágoston, Adrian Dumitrescu, Arsenii Sagdeev, Karamjeet Singh, Ji Zeng
Published in: Lecture Notes in Computer Science, Algorithms and Discrete Applied Mathematics, 2025, Page(s) 358-367
Publisher: Springer Nature Switzerland
DOI: 10.1007/978-3-031-83438-7_30

A Refutation of the Pach-Tardos Conjecture for 0-1 Matrices

Author(s): Seth Pettie, Gábor Tardos
Published in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Page(s) 4462-4483
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.152

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers

Author(s): Sujoy Bhore, Balázs Keszegh, Andrey Kupavskii, Hung Le, Alexandre Louvet, Dömötör Pálvölgyi, Csaba D. Tóth
Published in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Page(s) 4292-4326
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.145

Exchange Properties of Finite Set-Systems

Author(s): Peter Frankl, János Pach, Dömötör Pálvölgyi
Published in: Extended Abstracts EuroComb 2021 - European Conference on Combinatorics, Graph Theory and Applications, Issue 14, 2021, Page(s) 617-624, ISBN 978-3-030-83822-5
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-83823-2_99

Searching for OpenAIRE data...

Publications

Share this page Share this page on social networks

Download Download the content of the page