27 citations · 137 across the 40 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DM2014★ 1 cited
Densities in large permutations and parameter testing
Roman Glebov, Carlos Hoppen, Tereza Klimosova +3
A classical theorem of Erdos, Lovasz and Spencer asserts that the densities of connected subgraphs in large graphs are independent. We prove an analogue of this theorem for permuta…
math.CO2014
Powers of Hamilton cycles in pseudorandom graphs
Peter Allen, Julia Böttcher, Hiep Hàn +2
We study the appearance of powers of Hamilton cycles in pseudorandom graphs, using the following comparatively weak pseudorandomness notion. A graph is …