activity
20102026
most citedThe maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton--Milner family

27 citations · 137 across the 40 of their papers we have counts for

collaborators
Showing 2010Show all

2 papers · 1 filter

math.CO2010★ 1 cited

Properly coloured copies and rainbow copies of large graphs with small maximum degree

Julia Böttcher, Yoshiharu Kohayakawa, Aldo Procacci

Let G be a graph on n vertices with maximum degree D. We use the Lovász local lemma to show the following two results about colourings c of the edges of the complete graph K_n. If…

math.CO2010

Almost spanning subgraphs of random graphs after adversarial edge removal

Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz

Let Delta>1 be a fixed integer. We show that the random graph G(n,p) with p>>(log n/n)^{1/Delta} is robust with respect to the containment of almost spanning bipartite graphs H wit…