Andrzej Dudek

J. Graph Theory, December, 2023

2022

A gentle introduction to the differential equation method and dynamic concentration.

[BibT_eX]

[DOI]

Discret. Math., 2022

Localization game for random graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Patterns in Ordered (random) Matchings.

[BibT_eX]

[DOI]

Jaroslaw Grytczuk

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021

Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process.

[BibT_eX]

[DOI]

Ryan Cushman

SIAM J. Discret. Math., 2021

High powers of Hamiltonian cycles in randomly augmented graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

An analogue of the Erdős-Gallai theorem for random graphs.

[BibT_eX]

[DOI]

József Balogh

Lina Li

Eur. J. Comb., 2021

Hat chromatic number of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2021

On the number of alternating paths in random graphs.

[BibT_eX]

[DOI]

Ryan Cushman

Discret. Appl. Math., 2021

Variations on Twins in Permutations.

[BibT_eX]

[DOI]

Jaroslaw Grytczuk

Electron. J. Comb., 2021

2020

Powers of Hamiltonian cycles in randomly augmented graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

Large triangle packings and Tuza's conjecture in sparse random graphs.

[BibT_eX]

[DOI]

Shira Zerbib

Comb. Probab. Comput., 2020

Minimizing the number of 5-cycles in graphs with given edge-density.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2020

2019

A Random Variant of the Game of Plates and Olives.

[BibT_eX]

[DOI]

Sean English

SIAM J. Discret. Math., 2019

Large monochromatic components and long monochromatic cycles in random hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

Monochromatic loose paths in multicolored k-uniform cliques.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2019

A note on the localization number of random graphs: Diameter two case.

[BibT_eX]

[DOI]

Wesley Pegden

Discret. Appl. Math., 2019

2018

Randomly twisted hypercubes.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Size-Ramsey numbers of cycles versus a path.

[BibT_eX]

[DOI]

Farideh Khoeini

Discret. Math., 2018

On offset Hamilton cycles in random hypergraphs.

[BibT_eX]

[DOI]

Laars Helenius

Discret. Appl. Math., 2018

Note on the Multicolour Size-Ramsey Number for Paths, .

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

On Rainbow Hamilton Cycles in Random Hypergraphs.

[BibT_eX]

[DOI]

Sean English

Electron. J. Comb., 2018

Constructive Ramsey Numbers for Loose Hyperpaths.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

On some Multicolor Ramsey Properties of Random Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

On the Size-Ramsey Number of Hypergraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

On the Ramsey-Turán number with small s-independence number.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

On the Number of Alternating Paths in Bipartite Complete Graphs.

[BibT_eX]

[DOI]

Elliot Laforge

Graphs Comb., 2017

2016

Acquaintance Time of Random Graphs Near Connectivity Threshold.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

The vertex size-Ramsey number.

[BibT_eX]

[DOI]

Linda M. Lesniak

Discret. Math., 2016

The set chromatic number of random graphs.

[BibT_eX]

[DOI]

Dieter Mitsche

Discret. Appl. Math., 2016

Weak and Strong Versions of the 1-2-3 Conjecture for Uniform Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

The Total Acquisition Number of Random Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

2015

Rainbow Connection of Random Regular Graphs.

[BibT_eX]

[DOI]

Charalampos E. Tsourakakis

SIAM J. Discret. Math., 2015

Extensions of Results on Rainbow Hamilton Cycles in Uniform Hypergraphs.

[BibT_eX]

[DOI]

Michael Ferrara

Graphs Comb., 2015

An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2015

Loose Hamilton Cycles in Regular Hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2015

2014

Maker-breaker games on random geometric graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2014

On Generalized Ramsey Numbers for 3-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Dhruv Mubayi

J. Graph Theory, 2014

On generalized Ramsey numbers of Erdős and Rogers.

[BibT_eX]

[DOI]

Troy Retter

J. Comb. Theory B, 2014

The t-Tone Chromatic Number of Random Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2014

Approximate Counting of Matchings in (3,3)-Hypergraphs.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2014

On balanced colorings of sparse hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2014

A Note on a Ramsey-Type Problem for Sequences.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

Approximate Counting of Matchings in (3, 3)-Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory - SWAT 2014, 2014

2013

Tight Hamilton cycles in random uniform hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2013

Approximate counting of regular hypergraphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

On Minimum Saturated Matrices.

[BibT_eX]

[DOI]

Oleg Pikhurko

Andrew Thomason

Graphs Comb., 2013

Some recent results on Ramsey-type numbers.

[BibT_eX]

[DOI]

Peter Frankl

Discret. Appl. Math., 2013

2012

On induced Folkman numbers.

[BibT_eX]

[DOI]

Reshma Ramadurai

Random Struct. Algorithms, 2012

On the size and structure of graphs with a constant number of 1-factors.

[BibT_eX]

[DOI]

John R. Schmitt

Discret. Math., 2012

Some remarks on vertex Folkman numbers for hypergraphs.

[BibT_eX]

[DOI]

Reshma Ramadurai

Discret. Math., 2012

Cops and Robbers on Geometric Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2012

Optimal Divisibility Conditions for Loose Hamilton Cycles in Random Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

Rainbow Hamilton Cycles in Uniform Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

2011

Vertex colorings of graphs without short odd cycles.

[BibT_eX]

[DOI]

Reshma Ramadurai

J. Graph Theory, 2011

On the complexity of vertex-coloring edge-weightings.

[BibT_eX]

[DOI]

David Wajc

Discret. Math. Theor. Comput. Sci., 2011

On the maximum number of edges in a hypergraph with a unique perfect matching.

[BibT_eX]

[DOI]

Deepak Bal

Zelealem B. Yilma

Discret. Math., 2011

Loose Hamilton Cycles in Random Uniform Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

On Ks-free subgraphs in Ks+k-free graphs and vertex Folkman numbers.

[BibT_eX]

[DOI]

Comb., 2011

2010

Flips in Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

An almost quadratic bound on vertex Folkman numbers.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence.

[BibT_eX]

[DOI]

Joanna Polcyn

J. Comb. Optim., 2010

On k-partite hypergraphs with the induced epsilon-density property.

[BibT_eX]

[DOI]

Discret. Math., 2010

2009

On k-chromatically connected graphs.

[BibT_eX]

[DOI]

Esmeralda Nastase

Discret. Math., 2009

A Note on Universal and Canonically Coloured Sequences.

[BibT_eX]

[DOI]

Peter Frankl

Comb. Probab. Comput., 2009

2008

Finding Folkman Numbers via MAX CUT Problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

On the Folkman Number f(2, 3, 4).

[BibT_eX]

[DOI]

Exp. Math., 2008

On the Turán Properties of Infinite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

New Upper Bound on Vertex Folkman Numbers.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

Identification of Noisy Variables for Nonmetric and Symbolic Data in Cluster Analysis.

[BibT_eX]

[DOI]

Marek Walesiak

Proceedings of the Data Analysis, Machine Learning and Applications, 2007

2006

Cluster Quality Indexes for Symbolic Classification - An Examination.

[BibT_eX]

[DOI]