194 citations · 2.2k across the 69 of their papers we have counts for
4 papers · 1 filter
The extremal function for partial bipartite tilings
Codrut Grosu, Jan Hladky
For a fixed bipartite graph H and given number c, 0<c<1, we determine the threshold T_H(c) which guarantees that any n-vertex graph with at edge density at least T_H(c) contains $(…
Counting flags in triangle-free digraphs
Jan Hladky, Daniel Kral, Sergey Norin
Motivated by the Caccetta-Haggkvist Conjecture, we prove that every digraph on n vertices with minimum outdegree 0.3465n contains an oriented triangle. This improves the bound of 0…
Filling the gap between Turán's theorem and Pósa's conjecture
Peter Allen, Julia Böttcher, Jan Hladký
Much of extremal graph theory has concentrated either on finding very small subgraphs of a large graph (Turan-type results) or on finding spanning subgraphs (Dirac-type results). I…
The tripartite Ramsey number for trees
Julia Böttcher, Jan Hladky, Diana Piguet
We prove that for all epsilon>0 there are c>0 and n_0 such that for all n>n_0 the following holds. For any two-colouring of the edges of one colour contains copies of a…