Nearly perfect matchings in regular simple hypergraphs
From MaRDI portal
Publication:1366948
DOI10.1007/BF02773639zbMath0882.05107OpenAlexW1971289435MaRDI QIDQ1366948
Noga Alon, J. H. Spencer, Jeong Han Kim
Publication date: 17 September 1997
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02773639
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Triple systems (05B07)
Related Items
On Induced Paths, Holes, and Trees in Random Graphs, The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹, Crossing numbers of random graphs, Concentration of non‐Lipschitz functions and applications, Ramsey-nice families of graphs, Fractional v. integral covers in hypergraphs of bounded edge size, Covering the edges of a random hypergraph by cliques, New bounds for Ryser’s conjecture and related problems, Every Steiner triple system contains almost spanning \(d\)-ary hypertree, On 6-sparse Steiner triple systems, On partial parallel classes in partial Steiner triple systems, Unnamed Item, Packing nearly optimal Ramsey \(R(3,t)\) graphs, Longest partial transversals in plexes, Graph and hypergraph colouring via nibble methods: a survey, Colorful Matchings, Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor, New bounds on the size of nearly perfect matchings in almost regular hypergraphs, The localization number of designs, On the Method of Typical Bounded Differences, Minimalist designs, Almost all Steiner triple systems are almost resolvable, Unnamed Item, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, On the vertex cover number of 3-uniform hypergraph, New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help, Clumsy packings of graphs, Note on asymptotically good packings, Asymptotic Bounds for General Covering Designs, Cliques in Steiner systems, Spanning trees of 3-uniform hypergraphs, Asymptotic estimates on the von Neumann inequality for homogeneous polynomials, Voting rules that are unbiased but not transitive-symmetric, Triangulations and the Hajós conjecture, A natural barrier in random greedy hypergraph matching, Near-optimal, distributed edge colouring via the nibble method, Asymptotics for the Turán number of Berge-\(K_{2,t}\), Counting Independent Sets in Hypergraphs, Steiner Triple Systems without Parallel Classes, Random triangle removal
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic behavior of the chromatic index for hypergraphs
- On a packing and covering problem
- Near perfect coverings in graphs and hypergraphs
- More-than-nearly-perfect packings and partial designs
- A dense infinite Sidon sequence
- A note on partial parallel classes in Steiner systems
- Asymptotically good list-colorings
- Asymptotically optimal covering designs
- On the Size of Partial Parallel Classes in Steiner Systems
- On the Size of a Maximum Transversal in a Steiner Triple System
- Asymptotic packing via a branching process
- The Ramsey number R(3, t) has order of magnitude t2/log t
