30 citations · 216 across the 23 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.CO2012★ 6 cited
The approximate Loebl-Komlós-Sós Conjecture
Jan Hladký, János Komlós, Diana Piguet +3
We prove the following version of the Loebl-Komlos-Sos Conjecture: For every alpha>0 there exists a number M such that for every k>M every n-vertex graph G with at least (0.5+alpha…
math.CO2012★ 2 cited
2-Colored Matchings in a 3-Colored K^{3}_{12}
Neal Bushaw, Peter Csorba, Lindsay Erickson +5
Let denote the complete -uniform hypergraph on vertices. A matching in a hypergraph is a set of pairwise vertex disjoint edges. Recent Ramsey-type results re…