Mathias Schacht

J. Comb. Theory B, 2026

2024

Equivalent regular partitions of three-uniform hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2024

Ramsey Properties of Randomly Perturbed Hypergraphs.

[BibT_eX]

[DOI]

Elad Aigner-Horev

Dan Hefetz

Proceedings of the Approximation, 2024

2023

Canonical colourings in random graphs.

[BibT_eX]

[DOI]

Nina Kamcev

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Pedro Araújo

Simón Piga

SIAM J. Discret. Math., 2022

2021

High powers of Hamiltonian cycles in randomly augmented graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

On the size-Ramsey number of grid graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

Finding tight Hamilton cycles in random hypergraphs faster.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

Hamiltonian Berge cycles in random hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links.

[BibT_eX]

[DOI]

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs.

[BibT_eX]

[DOI]

Bhargav P. Narayanan

Random Struct. Algorithms, 2020

Embedding spanning subgraphs in uniformly dense and inseparable graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

Powers of Hamiltonian cycles in randomly augmented graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

On the structure of Dense graphs with bounded clique number.

[BibT_eX]

[DOI]

Heiner Oberkampf

Comb. Probab. Comput., 2020

Homomorphism Thresholds for Odd Cycles.

[BibT_eX]

[DOI]

Oliver Ebsen

Comb., 2020

2018

Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2018

Hypergraphs with vanishing Turán density in uniformly dense hypergraphs.

[BibT_eX]

[DOI]

Christian Reiher

Josefran de Oliveira Bastos

J. Lond. Math. Soc., 2018

2017

Loose Hamiltonian Cycles Forced by Large (k-2)-Degree - Approximate Version.

[BibT_eX]

[DOI]

Jakob Schnitzer

SIAM J. Discret. Math., 2017

Monochromatic trees in random graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

On the local density problem for graphs of given odd-girth.

[BibT_eX]

[DOI]

Wiebke Bedenknecht

Christian Reiher

Josefran de Oliveira Bastos

Electron. Notes Discret. Math., 2017

Loose Hamiltonian cycles forced by large (k - 2)-degree - sharp version.

[BibT_eX]

[DOI]

Jakob Schnitzer

Electron. Notes Discret. Math., 2017

Quasirandomness in hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Counting results for sparse pseudorandom hypergraphs II.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Counting results for sparse pseudorandom hypergraphs I.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Ramsey properties of random graphs and Folkman numbers.

[BibT_eX]

[DOI]

Andrzej Rucinski

Discuss. Math. Graph Theory, 2017

An exponential-type upper bound for Folkman numbers.

[BibT_eX]

[DOI]

Andrzej Rucinski

Comb., 2017

2016

Embedding tetrahedra into quasirandom hypergraphs.

[BibT_eX]

[DOI]

Christian Reiher

J. Comb. Theory B, 2016

Packing minor-closed families of graphs into complete graphs.

[BibT_eX]

[DOI]

Silvia Messuti

Josefran de Oliveira Bastos

J. Comb. Theory B, 2016

Loose Hamiltonian cycles forced by (k - 2)-degree - approximate version.

[BibT_eX]

[DOI]

Jakob Schnitzer

Electron. Notes Discret. Math., 2016

An Algorithmic Hypergraph Regularity Lemma.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

On the Structure of Graphs with Given Odd Girth and Large Minimum Degree.

[BibT_eX]

[DOI]

Silvia Messuti

J. Graph Theory, 2015

Packing minor closed families of graphs.

[BibT_eX]

[DOI]

Silvia Messuti

Electron. Notes Discret. Math., 2015

A counting lemma for sparse pseudorandom hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Ramsey-type numbers involving graphs and hypergraphs with large girth.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Ramsey numbers for bipartite graphs with small bandwidth.

[BibT_eX]

[DOI]

Gábor N. Sárközy

Eur. J. Comb., 2015

2014

Upper bounds on probability thresholds for asymmetric Ramsey properties.

[BibT_eX]

[DOI]

Reto Spöhel

Random Struct. Algorithms, 2014

Extremal results for odd cycles in sparse pseudorandom graphs.

[BibT_eX]

[DOI]

Elad Aigner-Horev

Comb., 2014

2012

Complete Partite subgraphs in dense hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2012

Weak quasi-randomness for uniform hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2012

On Even-Degree Subgraphs of Linear Hypergraphs.

[BibT_eX]

[DOI]

Domingos Dellamonica Jr.

Comb. Probab. Comput., 2012

2011

Note on forcing pairs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs.

[BibT_eX]

[DOI]

Enno Buß

Electron. Notes Discret. Math., 2011

Untangling planar graphs from a specified vertex position - Hard cases.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

2010

Regular partitions of hypergraphs and property testing

[BibT_eX]

[DOI]

PhD thesis, 2010

Note on Bipartite Graph Tilings.

[BibT_eX]

[DOI]

Jan Hladký

SIAM J. Discret. Math., 2010

Ramsey properties of random discrete structures.

[BibT_eX]

[DOI]

Ehud Friedgut

Random Struct. Algorithms, 2010

Weak hypergraph regularity and linear hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

Dirac-type results for loose Hamilton cycles in uniform hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

2009

On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

An expected polynomial time algorithm for coloring 2-colorable 3-graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Note on strong refutation algorithms for random k-SAT formulas.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

On Colourings of Hypergraphs Without Monochromatic Fano Planes.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

Generalizations of the removal lemma.

[BibT_eX]

[DOI]

Comb., 2009

Almost all hypergraphs without Fano planes are bipartite.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Hypergraph regularity and quasi-randomness.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

Spanning 3-colourable subgraphs of small bandwidth in dense graphs.

[BibT_eX]

[DOI]

Julia Böttcher

J. Comb. Theory B, 2008

On the Ramsey Number of Sparse 3-Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2008

Note on the 3-graph counting lemma.

[BibT_eX]

[DOI]

Discret. Math., 2008

Obfuscated Drawings of Planar Graphs

[BibT_eX]

[DOI]

CoRR, 2008

2007

Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Andrzej Rucinski

SIAM J. Discret. Math., 2007

Integer and fractional packings of hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

Turán's theorem for pseudo-random graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2007

Embedding spanning subgraphs of small bandwidth.

[BibT_eX]

[DOI]

Julia Böttcher

Electron. Notes Discret. Math., 2007

Regular Partitions of Hypergraphs: Counting Lemmas.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

Regular Partitions of Hypergraphs: Regularity Lemmas.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

Property testing in hypergraphs and the removal lemma.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

On the bandwidth conjecture for 3-colourable graphs.

[BibT_eX]

[DOI]

Julia Böttcher

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

The counting lemma for regular <i>k</i>-uniform hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2006

2005

Globally bounded local edge colourings of hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Every Monotone 3-Graph Property is Testable.

[BibT_eX]

[DOI]

Christian Avart

Electron. Notes Discret. Math., 2005

2004

The Turán Theorem for Random Graphs.

[BibT_eX]

[DOI]