New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
From MaRDI portal
Publication:4500484
DOI10.1002/1098-2418(200008)17:1%3C29::AID-RSA4%3E3.0.CO;2-WzbMATH Open0953.05056OpenAlexW1988229094MaRDI QIDQ4500484FDOQ4500484
Authors: Van Vu 
Publication date: 23 January 2001
Full work available at URL: https://doi.org/10.1002/1098-2418(200008)17:1%3C29::aid-rsa4%3E3.0.co;2-w
Recommendations
- Near perfect matchings in \(k\)-uniform hypergraphs
- Perfect matchings in uniform hypergraphs with large minimum degree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Nearly perfect matchings in regular simple hypergraphs
- On the number of nearly perfect matchings in almost regular uniform hypergraphs
Graph algorithms (graph-theoretic aspects) (05C85) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- On a packing and covering problem
- Small complete arcs in projective planes
- Near perfect coverings in graphs and hypergraphs
- Concentration of measure and isoperimetric inequalities in product spaces
- Asymptotic behavior of the chromatic index for hypergraphs
- Nearly-perfect hypergraph packing is in NC
- Nearly perfect matchings in regular simple hypergraphs
- Asymptotically good list-colorings
- On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs
- On the difference between asymptotically good packings and coverings
- Asymptotically optimal covering designs
- Asymptotic packing via a branching process
- Title not available (Why is that?)
Cited In (13)
- New bounds on the size of nearly perfect matchings in almost regular hypergraphs
- Note on asymptotically good packings
- Long gaps between primes
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- On a refinement of Waring's problem
- Computing the partition function for perfect matchings in a hypergraph
- The infamous upper tail
- Arboricity: an acyclic hypergraph decomposition problem motivated by database theory
- Graph and hypergraph colouring via nibble methods: a survey
- When almost all sets are difference dominated
- Piercing random boxes
- Concentration of non‐Lipschitz functions and applications
- A natural barrier in random greedy hypergraph matching
This page was built for publication: New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500484)
