0 references
On the Random Greedy $F$-Free Hypergraph Process
Electronic Notes in Discrete Mathematics2015Vol. 30(3), pp. 1343–1350
Related Papers
- → Perfect matchings in large uniform hypergraphs with large minimum collective degree(2008)167 cited
- → Linear trees in uniform hypergraphs(2013)34 cited
- → Some Ore-type Results for Matching and Perfect Matching in k-uniform Hypergraphs(2018)6 cited
- → Lower bound on the size-Ramsey number of tight paths(2022)1 cited
- → Lower bounds on Tuza constants for transversals in linear uniform hypergraphs(2021)1 cited