194 citations · 2.2k across the 69 of their papers we have counts for
Showing 2008Show all
3 papers · 1 filter
math.CO2008★ 7 cited
Note on bipartite graph tilings
Jan Hladky, Mathias Schacht
Let s<t be two fixed positive integers. We study what are the minimum degree conditions for a bipartite graph G, with both color classes of size n=k(s+t), which ensure that G has a…
math.CO2008★ 2 cited
A combinatorial proof of Rayleigh monotonicity for graphs
J. Cibulka, J. Hladky, M. A. LaCroix +1
We give an elementary, self-contained, and purely combinatorial proof of the Rayleigh monotonicity property of graphs.
math.CO2008★ 16 cited
Loebl-Komlos-Sos Conjecture: dense case
Jan Hladky, Diana Piguet
We prove a version of the Loebl-Komlos-Sos Conjecture for dense graphs. For each q>0 there exists a number such that for any n>n_0 and k>qn the following holds:…