13 citations · 38 across the 15 of their papers we have counts for
22 papers
Graphs with large minimum degree and no small odd cycles are -colourable
Julia Böttcher, Nóra Frankl, Domenico Mergoni Cecchelli +2
Answering a question by Letzter and Snyder, we prove that for large enough any -vertex graph with minimum degree at least and without odd cycles of len…
A general approach to transversal versions of Dirac-type theorems
Pranshu Gupta, Fabian Hamann, Alp Müyesser +2
Given a collection of hypergraphs with the same vertex set, an -edge graph is a transversal if there is a bijection $…
New Ramsey Multiplicity Bounds and Search Heuristics
Olaf Parczyk, Sebastian Pokutta, Christoph Spiegel +1
We study two related problems concerning the number of homogeneous subsets of given size in graphs that go back to questions of Erdős. Most notably, we improve the upper bounds on…
The square of a Hamilton cycle in randomly perturbed graphs
Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia +1
We investigate the appearance of the square of a Hamilton cycle in the model of randomly perturbed graphs, which is, for a given , the union of any -vertex graph wit…
Minimum degree conditions for containing an -regular -connected subgraph
Max Hahn-Klimroth, Olaf Parczyk, Yury Person
We study optimal minimum degree conditions when an -vertex graph contains an -regular -connected subgraph. We prove for fixed and large the condition to be $δ(…
Resilience for tight Hamiltonicity
Peter Allen, Olaf Parczyk, Vincent Pfenninger
We prove that random hypergraphs are asymptotically almost surely resiliently Hamiltonian. Specifically, for any and , we show that asymptotically almost surely, every…