Yury Person

Eur. J. Comb., 2024

2023

Spanning -cycles in random graphs.

[BibT_eX]

[DOI]

Alberto Espuny Díaz

Comb. Probab. Comput., September, 2023

An asymmetric random Rado theorem: 1-statement.

[BibT_eX]

[DOI]

Elad Aigner-Horev

J. Comb. Theory A, 2023

2022

On sparse random combinatorial matrices.

[BibT_eX]

[DOI]

Elad Aigner-Horev

Discret. Math., 2022

2021

Finding any given 2-factor in sparse pseudorandom graphs efficiently.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Minimum degree conditions for containing an r-regular r-connected subgraph.

[BibT_eX]

[DOI]

Max Hahn-Klimroth

CoRR, 2021

2020

A Dirac-type Theorem for Berge Cycles in Random Hypergraphs.

[BibT_eX]

[DOI]

Julia Ehrenmüller

Electron. J. Comb., 2020

2019

Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers.

[BibT_eX]

[DOI]

Elad Aigner-Horev

SIAM J. Discret. Math., 2019

Universality for bounded degree spanning trees in randomly perturbed graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2019

Clique-factors in sparse pseudorandom graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

2018

Near-perfect clique-factors in sparse pseudorandom graphs.

[BibT_eX]

[DOI]

Jie Han

Yoshiharu Kohayakawa

Electron. Notes Discret. Math., 2018

Largest Components in Random Hypergraphs.

[BibT_eX]

[DOI]

Oliver Cooley

Mihyun Kang

Comb. Probab. Comput., 2018

Finding Tight Hamilton Cycles in Random Hypergraphs Faster.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

An algorithmic framework for obtaining lower bounds for random Ramsey problems.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Minimum rainbow H-decompositions of graphs.

[BibT_eX]

[DOI]

Lale Özkahya

Electron. Notes Discret. Math., 2017

Embedding spanning bounded degree subgraphs in randomly perturbed graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Quasirandomness in hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Powers of Hamilton cycles in pseudorandom graphs.

[BibT_eX]

[DOI]

Comb., 2017

2016

Spanning structures and universality in sparse hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

On the minimum degree of minimal Ramsey graphs for multiple colours.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs.

[BibT_eX]

[DOI]

Julia Ehrenmüller

Electron. Notes Discret. Math., 2016

On the multicolor Ramsey number of a graph with m edges.

[BibT_eX]

[DOI]

Kathleen Johst

Discret. Math., 2016

Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2016

On Universal Hypergraphs.

[BibT_eX]

[DOI]

Samuel Hetterich

Electron. J. Comb., 2016

2015

Tight Hamilton cycles in random hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2015

On Spanning Structures in Random Hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Keeping Avoider's Graph Almost Acyclic.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

2014

On the rank of higher inclusion matrices.

[BibT_eX]

[DOI]

Codrut Grosu

Tibor Szabó

J. Lond. Math. Soc., 2014

What is Ramsey-equivalent to a clique?

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

An improved error term for minimum H-decompositions of graphs.

[BibT_eX]

[DOI]

Peter Allen

Julia Böttcher

J. Comb. Theory B, 2014

2013

Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs.

[BibT_eX]

[DOI]

Hanno Lefmann

J. Graph Theory, 2013

A regularity lemma and twins in words.

[BibT_eX]

[DOI]

Maria Axenovich

Svetlana Puzynina

J. Comb. Theory A, 2013

An approximate blow-up lemma for sparse pseudorandom graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

2012

Weak quasi-randomness for uniform hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2012

Minimum H-decompositions of graphs: Edge-critical case.

[BibT_eX]

[DOI]

Lale Özkahya

J. Comb. Theory B, 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]

Hiêp Hàn

Electron. Notes Discret. Math., 2011

A Randomized Version of Ramsey's Theorem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

On Extremal Hypergraphs for Hamiltonian Cycles.

[BibT_eX]

[DOI]

Roman Glebov

Wilma Weps

Electron. Notes Discret. Math., 2011

2009

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

[BibT_eX]

[DOI]

Hiêp Hàn

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]

Hiêp Hàn

Electron. Notes Discret. Math., 2009

Highly connected coloured subgraphs via the regularity lemma.

[BibT_eX]

[DOI]

Henry Liu

Discret. Math., 2009

On Colourings of Hypergraphs Without Monochromatic Fano Planes.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

Almost all hypergraphs without Fano planes are bipartite.

[BibT_eX]

[DOI]