Oliver Cooley

Jean Bernoulli Ravelomanana

Julian Zalla

Electron. J. Comb., 2022

Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

The Sparse Parity Matrix.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Longest Paths in Random Hypergraphs.

[BibT_eX]

[DOI]

Nicolás Sanhueza-Matamala

Julian Zalla

SIAM J. Discret. Math., 2021

Large Induced Matchings in Random Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

2020

Subcritical Random Hypergraphs, High-Order Components, and Hypertrees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Vanishing of cohomology groups of random simplicial complexes.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

2019

Core forging and local limit theorems for the <i>k</i>-core of random graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2019

The Size of the Giant Component in Random Hypergraphs: a Short Proof.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

2018

The size of the giant high-order component in random hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2018

Largest Components in Random Hypergraphs.

[BibT_eX]

[DOI]

Yury Person

Comb. Probab. Comput., 2018

Vanishing of Cohomology Groups of Random Simplicial Complexes (Keynote Speakers).

[BibT_eX]

[DOI]

Proceedings of the 29th International Conference on Probabilistic, 2018

2017

The Minimum Bisection in the Planted Bisection Model.

[BibT_eX]

[DOI]

Theory Comput., 2017

Tight cycles and regular slices in dense hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2017

Jigsaw percolation on random hypergraphs.

[BibT_eX]

[DOI]

J. Appl. Probab., 2017

Homological connectedness of random hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph.

[BibT_eX]

[DOI]

Richard Mycroft

Discret. Math., 2017

Core forging and local limit theorems for the k-core of random graphs.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

2015

Evolution of high-order connected components in random hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

How does the core sit inside the mantle?

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Regular slices for hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Tight Cycles in Hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

2009

Loebl-Komlós-Sós Conjecture: dense case.

[BibT_eX]

[DOI]

Jan Hladký

Diana Piguet

Electron. Notes Discret. Math., 2009

Minimum degree conditions for large subgraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

Embeddings and Ramsey numbers of sparse <i>kappa</i>-uniform hypergraphs.

[BibT_eX]

[DOI]

Nikolaos Fountoulakis

Comb., 2009

2008

3-Uniform hypergraphs of bounded degree have linear Ramsey numbers.

[BibT_eX]

[DOI]

Nikolaos Fountoulakis

J. Comb. Theory, Ser. B, 2008

2007

Ramsey numbers of sparse hypergraphs.

[BibT_eX]

[DOI]

Nikolaos Fountoulakis

Electron. Notes Discret. Math., 2007

Perfect packings with complete graphs minus an edge.

[BibT_eX]

[DOI]