2 citations · 4 across the 2 of their papers we have counts for
2 papers
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…
math.CO2007★ 2 cited
The Loebl-Komlos-Sos conjecture for trees of diameter 5 and for certain caterpillars
Diana Piguet, Maya Jakobine Stein
Loebl, Komlos, and Sos conjectured that if at least half the vertices of a graph G have degree at least some k, then every tree with at most k edges is a subgraph of G. We prove th…