4 citations · 15 across the 25 of their papers we have counts for
3 papers · 1 filter
Tiling 3-uniform hypergraphs with K_4^3-2e
Andrzej Czygrinow, Louis DeBiasio, Brendan Nagle
Let K_4^3-2e denote the hypergraph consisting of two triples on four points. For an integer n, let t(n, K_4^3-2e) denote the smallest integer d so that every 3-uniform hypergraph G…
Pósa's Conjecture for graphs of order at least 2\times 10^8
Phong Châu, Louis DeBiasio, H. A. Kierstead
In 1962 Pósa conjectured that every graph G on n vertices with minimum degree at least 2n/3 contains the square of a hamiltonian cycle. In 1996 Fan and Kierstead proved the path ve…
A note on bipartite graph tiling
Andrzej Czygrinow, Louis DeBiasio
Bipartite graph tiling was studied by Zhao who gave the best possible minimum degree conditions for a balanced bipartite graph on 2ms vertices to contain m vertex disjoint copies o…