Large Discrete Structures

Project Information

LaDIST

Grant agreement ID: 648509

DOI

10.3030/648509

Project closed

EC signature date 11 March 2015

Start date 1 December 2015

End date 31 December 2021

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost

€ 1 386 859,00

EU contribution

€ 1 386 859,00

Coordinated by

Masarykova univerzita
Czechia

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

Other (28)

Sharp bounds for decomposing graphs into edges and triangles

Author(s): Blumenthal, Adam; Lidický, Bernard; Pehova, Yanitsa; Pfender, Florian; Pikhurko, Oleg; Volec, Jan
Published in: Combinatorics, Probability and Computing, 2020
Publisher: Cambridge University Press
DOI: 10.1017/s0963548320000358

Cycles of a given length in tournaments

Author(s): Grzesik, Andrzej; Kral, Daniel; Lovasz, Laszlo Miklos; Volec, Jan
Published in: ArXiv, 2020
Publisher: ArXiv

On tripartite common graphs

Author(s): Grzesik, Andrzej; Lee, Joonkyung; Lidický, Bernard; Volec, Jan
Published in: arXiv, 2020
Publisher: ArXiv

Sharp bounds for decomposing graphs into edges and triangles

Author(s): Blumenthal, A., Lidický, B., Pikhurko, O., Pehova, Y., Pfender, F., & Volec, J.
Published in: Acta Mathematica Universitatis Comenianae, Issue 88, 2019, Page(s) 463-468
Publisher: AMUC

Non-bipartite k-common graphs

Author(s): Kral, Daniel; Noel, Jonathan A.; Norin, Sergey; Volec, Jan; Wei, Fan
Published in: ArXiv, 2019
Publisher: ArXiv

Tuza's Conjecture for Threshold Graphs

Author(s): M. Bonamy, Ł. Bożyk, A. Grzesik, M. Hatzel, T. Masařík, J. Novotná, K. Okrasa
Published in: ArXiv, 2021
Publisher: ArXiv

Exact hyperplane covers for subsets of the hypercube

Author(s): James Aaronson; Carla Groenland; Andrzej Grzesik; Tom Johnston; Bartłomiej Kielak
Published in: Discrete Mathematics, 2021
Publisher: Elsevier
DOI: 10.1016/j.disc.2021.112490

Hypergraphs with minimum positive uniform Turán density

Author(s): F. Garbe, D. Kráľ, A. Lamaison
Published in: ArXiv, 2021
Publisher: ArXiv

From flip processes to dynamical systems on graphons

Author(s): F. Garbe, J. Hladký, M. Šileikis, F. Skerman
Published in: ArXiv, 2022
Publisher: ArXiv

Limits of Latin squares

Author(s): Garbe, Frederik; Hancock, Robert; Hladký, Jan; Sharifzadeh, Maryam
Published in: ArXiv, 2020
Publisher: ArXiv

Quasirandom Latin squares

Author(s): Cooper, Jacob W.; Kral, Daniel; Lamaison, Ander; Mohr, Samuel
Published in: Random Structures and Algorithms, 2020
Publisher: Wiley Online Library
DOI: 10.1002/rsa.21060

Degree conditions forcing directed cycles

Author(s): Grzesik, Andrzej; Volec, Jan
Published in: ArXiv, 2021
Publisher: ArXiv

Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming

Author(s): Chan, Timothy F. N.; Cooper, Jacob W.; Koutecky, Martin; Kral, Daniel; Pekarkova, Kristyna
Published in: ArXiv, 2019
Publisher: ArXiv

Uniform Turán density of cycles

Author(s): M. Bucić, J. W. Cooper, D. Kráľ, S. Mohr, D. M. Correia
Published in: ArXiv, 2021
Publisher: ArXiv

Transversal factors and spanning trees

Author(s): Montgomery, Richard; Müyesser, Alp; Pehova, Yanitsa
Published in: ArXiv, 2021
Publisher: ArXiv

Finitely forcible graphons with an almost arbitrary structure

Author(s): D. Kráľ, L. M. Lovász, J. A. Noel, J. Sosnovec
Published in: 2018
Publisher: Discrete Analysis
DOI: 10.19086/da.12058

Ramsey numbers of ordered graphs under graph operations

Author(s): Geneson, Jesse; Holmes, Amber; Liu, Xujun; Neidinger, Dana; Pehova, Yanitsa; Wass, Isaac
Published in: ArXiv, 2019
Publisher: ArXiv

Polynomial Schur's theorem

Author(s): Liu, Hong; Pach, Péter Pál; Sándor, Csaba
Published in: ArXiv, 2018
Publisher: ArXiv

The Tur\'an number of blow-ups of trees

Author(s): Grzesik, Andrzej; Janzer, Oliver; Nagy, Zoltán Lóránt
Published in: ArXiv, 2019
Publisher: ArXiv

Packing and covering directed triangles asymptotically

Author(s): Jacob W. Cooper, Andrzej Grzesik, Adam Kabela, Daniel Kral
Published in: European Journal of Combinatorics, 2019
Publisher: Elsevier
DOI: 10.1016/j.ejc.2021.103462

No additional tournaments are quasirandom-forcing

Author(s): Robert Hancock, Adam Kabela, Daniel Kral, Taisa Martins, Roberto Parente, Fiona Skerman, Jan Volec
Published in: ArXiv, 2019
Publisher: ArXiv

Covering minimal separators and potential maximal cliques in Pt-free graphs

Author(s): Andrzej Grzesik, Tereza Klimošová, Marcin Pilipczuk, Michał Pilipczuk
Published in: The Electronic Journal of Combinatorics, 2020
Publisher: Free Journal Network
DOI: 10.37236/9473

An asymmetric random Rado theorem for single equations: the 0-statement

Author(s): Robert Hancock, Andrew Treglown
Published in: Random Structures and Algorithms, 2020
Publisher: Wiley Online Library
DOI: 10.1002/rsa.21039

Towards characterizing locally common graphs

Author(s): Hancock, Robert; Kral, Daniel; Krnc, Matjaz; Volec, Jan
Published in: ArXiv, 2020
Publisher: ArXiv

Inducibility and universality for trees

Author(s): Chan, Timothy F. N.; Kral, Daniel; Mohar, Bojan; Wood, David R.
Published in: ArXiv, 2021
Publisher: ArXiv

Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming

Author(s): M. Brianski, M. Koutecký, D. Kráľ, K. Pekárková, F. Schroder
Published in: ArXiv, 2022
Publisher: ArXiv

Tilings in graphons

Author(s): Jan Hladký; Ping Hu; Diana Piguet
Published in: European Journal of Combinatorics, Issue 1, 2021
Publisher: Elsevier
DOI: 10.1016/j.ejc.2020.103284

The number of maximum primitive sets of integers

Author(s): Hong Liu; Péter Pál Pach; Richárd Palincza
Published in: Combinatorics, Probability and Computing, 2021
Publisher: Cambridge University Press
DOI: 10.1017/s0963548321000018

Peer reviewed articles (20)

An improved upper bound for the size of the multiplicative 3-Sidon sets

Author(s): Péter Pál Pach
Published in: International Journal of Number Theory, Issue 15/08, 2019, Page(s) 1721-1729, ISSN 1793-0421
Publisher: World Scientific Publishing Co
DOI: 10.1142/s1793042119500957

Monochromatic solutions to x+y=z2 in the interval [N,cN4]

Author(s): Péter Pál Pach
Published in: Bulletin of the London Mathematical Society, Issue 50/6, 2018, Page(s) 1113-1116, ISSN 0024-6093
Publisher: Oxford University Press
DOI: 10.1112/blms.12207

Long paths and connectivity in 1‐independent random graphs

Author(s): A. Nicholas Day, Victor Falgas‐Ravry, Robert Hancock
Published in: Random Structures & Algorithms, Issue 57/4, 2020, Page(s) 1007-1049, ISSN 1042-9832
Publisher: John Wiley & Sons Inc.
DOI: 10.1002/rsa.20972

Cycles of length three and four in tournaments

Author(s): Timothy F.N. Chan, Andrzej Grzesik, Daniel Král', Jonathan A. Noel
Published in: Journal of Combinatorial Theory, Series A, Issue 175, 2020, Page(s) 105276, ISSN 0097-3165
Publisher: Academic Press
DOI: 10.1016/j.jcta.2020.105276

Walk entropy and walk-regularity

Author(s): Kyle Kloster, Daniel Král', Blair D. Sullivan
Published in: Linear Algebra and its Applications, Issue 546, 2018, Page(s) 115-121, ISSN 0024-3795
Publisher: Elsevier BV
DOI: 10.1016/j.laa.2018.02.009

Finitely forcible graph limits are universal

Author(s): Jacob W. Cooper, Daniel Král', Taísa L. Martins
Published in: Advances in Mathematics, Issue 340, 2018, Page(s) 819-854, ISSN 0001-8708
Publisher: Academic Press
DOI: 10.1016/j.aim.2018.10.019

Decomposing Graphs into Edges and Triangles

Author(s): DANIEL KRÁL', BERNARD LIDICKÝ, TAÍSA L. MARTINS, YANITSA PEHOVA
Published in: Combinatorics, Probability and Computing, Issue 28/3, 2019, Page(s) 465-472, ISSN 0963-5483
Publisher: Cambridge University Press
DOI: 10.1017/s0963548318000421

Triangle-free planar graphs with small independence number

Author(s): Zdeněk Dvořák, Jordan Venters
Published in: European Journal of Combinatorics, Issue 76, 2019, Page(s) 88-103, ISSN 0195-6698
Publisher: Academic Press
DOI: 10.1016/j.ejc.2018.09.008

Infinite‐dimensional finitely forcible graphon

Author(s): Roman Glebov, Tereza Klimošová, Daniel Král'
Published in: Proceedings of the London Mathematical Society, Issue 118/4, 2018, Page(s) 826-856, ISSN 0024-6115
Publisher: Oxford University Press
DOI: 10.1112/plms.12203

Densities in large permutations and parameter testing

Author(s): Roman Glebov, Carlos Hoppen, Tereza Klimošová, Yoshiharu Kohayakawa, Daniel Král’, Hong Liu
Published in: European Journal of Combinatorics, Issue 60, 2017, Page(s) 89-99, ISSN 0195-6698
Publisher: Academic Press
DOI: 10.1016/j.ejc.2016.09.006

The number of multiplicative Sidon sets of integers

Author(s): Hong Liu, Péter Pál Pach
Published in: Journal of Combinatorial Theory, Series A, Issue 165, 2019, Page(s) 152-175, ISSN 0097-3165
Publisher: Academic Press
DOI: 10.1016/j.jcta.2019.02.002

The step Sidorenko property and non-norming edge-transitive graphs

Author(s): Daniel Král', Taísa L. Martins, Péter Pál Pach, Marcin Wrochna
Published in: Journal of Combinatorial Theory, Series A, Issue 162, 2019, Page(s) 34-54, ISSN 0097-3165
Publisher: Academic Press
DOI: 10.1016/j.jcta.2018.09.012

Minimum number of edges that occur in odd cycles

Author(s): Andrzej Grzesik, Ping Hu, Jan Volec
Published in: Journal of Combinatorial Theory, Series B, Issue 137, 2019, Page(s) 65-103, ISSN 0095-8956
Publisher: Academic Press
DOI: 10.1016/j.jctb.2018.12.003

A bound on the inducibility of cycles

Author(s): Daniel Král', Sergey Norin, Jan Volec
Published in: Journal of Combinatorial Theory, Series A, Issue 161, 2019, Page(s) 359-363, ISSN 0097-3165
Publisher: Academic Press
DOI: 10.1016/j.jcta.2018.08.003

Komlós's tiling theorem via graphon covers

Author(s): Jan Hladký, Ping Hu, Diana Piguet
Published in: Journal of Graph Theory, Issue 90/1, 2019, Page(s) 24-45, ISSN 0364-9024
Publisher: John Wiley & Sons Inc.
DOI: 10.1002/jgt.22365

Compactness and finite forcibility of graphons

Author(s): Roman Glebov, Daniel Král', Jan Volec
Published in: Journal of the European Mathematical Society, Issue 21/10, 2019, Page(s) 3199-3223, ISSN 1435-9855
Publisher: European Mathematical Society Publishing House
DOI: 10.4171/jems/901

Characterization of quasirandom permutations by a pattern sum

Author(s): Timothy F. N. Chan, Daniel Král', Jonathan A. Noel, Yanitsa Pehova, Maryam Sharifzadeh, Jan Volec
Published in: Random Structures & Algorithms, Issue 57/4, 2020, Page(s) 920-939, ISSN 1042-9832
Publisher: John Wiley & Sons Inc.
DOI: 10.1002/rsa.20956

Extremal graph theory and finite forcibility

Author(s): Andrzej Grzesik, Daniel Král', László Miklós Lovász
Published in: Electronic Notes in Discrete Mathematics, Issue 61, 2017, Page(s) 541-547, ISSN 1571-0653
Publisher: Elsevier BV
DOI: 10.1016/j.endm.2017.07.005

First steps in combinatorial optimization on graphons: Matchings

Author(s): Martin Doležal, Jan Hladký, Ping Hu, Diana Piguet
Published in: Electronic Notes in Discrete Mathematics, Issue 61, 2017, Page(s) 359-365, ISSN 1571-0653
Publisher: Elsevier BV
DOI: 10.1016/j.endm.2017.06.060

On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem

Author(s): Rajko Nenadov, Yanitsa Pehova
Published in: SIAM Journal on Discrete Mathematics, Issue 34/2, 2020, Page(s) 1001-1010, ISSN 0895-4801
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/18m1211970

Conference proceedings (7)

Hypergraphs with minimum positive uniform Tur\'an density

Author(s): Garbe, Frederik; Kral, Daniel; Lamaison, Ander
Published in: Extended Abstracts EuroComb 2021, 2021
Publisher: Birkhäuser, Cham
DOI: 10.1007/978-3-030-83823-2_24

Strong modeling limits of graphs with bounded tree-width

Author(s): Grzesik, Andrzej; Kráľ, Daniel; Mohr, Samuel
Published in: Extended Abstracts EuroComb 2021, 2021
Publisher: Birkhäuser, Cham
DOI: 10.1007/978-3-030-83823-2_43

Cycles of length three and four in tournaments

Author(s): Chan, Timothy F. N.; Grzesik, Andrzej; Kral, Daniel; Noel, Jonathan A.
Published in: Acta Mathematica Universitatis Comenianae, Issue 88, 2019, Page(s) 533-539
Publisher: AMUC

Graphic TSP in Cubic Graphs

Author(s): Zdeněk Dvořák, Daniel Kráľ, Bojan Mohar
Published in: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Issue 66, 2017, Page(s) 27:1--27:13, ISBN 978-3-95977-028-6
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.STACS.2017.27

More non-bipartite forcing pairs

Author(s): Hubai, Tamas; Kral, Dan; Parczyk, Olaf; Person, Yury
Published in: Acta Mathematica Universitatis Comenianae, Issue 88, 2019, Page(s) 819-825
Publisher: AMUC

Optimal matrix tree-depth and a row-invariant parameterized algorithm for integer programming

Author(s): Chan, Timothy; Cooper, Jacob W.; Koutecky, Martin; Kral, Daniel; Pekarkova, Kristyna
Published in: Proceedings of 47th International Colloquium Automata, Languages and Programming (ICALP'20), 2019
Publisher: ArXiv
DOI: 10.4230/lipics.icalp.2020.26

Recovering sparse graphs

Author(s): Gajarský, Jakub; Král', Daniel
Published in: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), 2018
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.mfcs.2018.29

Non-peer reviewed articles (2)

Elusive extremal graphs

Author(s): Andrzej Grzesik, Daniel Král, László Miklós Lovász
Published in: Proceedings of the London Mathematical Society, Issue 121/6, 2020, Page(s) 1685-1736, ISSN 0024-6115
Publisher: Oxford University Press
DOI: 10.1112/plms.12382

An approximate version of Jackson’s conjecture

Author(s): Anita Liebenau, Yanitsa Pehova
Published in: Combinatorics, Probability and Computing, Issue 29/6, 2020, Page(s) 886-899, ISSN 0963-5483
Publisher: Cambridge University Press
DOI: 10.1017/s0963548320000152