194 citations · 2.2k across the 69 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
math.CO2010★ 3 cited
Turánnical hypergraphs
Peter Allen, Julia Böttcher, Jan Hladký +1
This paper is motivated by the question of how global and dense restriction sets in results from extremal combinatorics can be replaced by less global and sparser ones. The result…
math.CO2010★ 6 cited
Hamilton cycles in dense vertex-transitive graphs
Demetres Christofides, Jan Hladký, András Máthé
A famous conjecture of Lovász states that every connected vertex-transitive graph contains a Hamilton path. In this article we confirm the conjecture in the case that the graph is…