Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture
From MaRDI portal
Publication:3178439
DOI10.1137/16M1056079zbMath1339.05310arXiv1512.07177OpenAlexW2963800089WikidataQ123130618 ScholiaQ123130618MaRDI QIDQ3178439
Publication date: 13 July 2016
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.07177
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (15)
A note on exact minimum degree threshold for fractional perfect matchings ⋮ Matching of Given Sizes in Hypergraphs ⋮ Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs ⋮ Near Perfect Matchings in ${k}$-Uniform Hypergraphs II ⋮ The Erdős matching conjecture and concentration inequalities ⋮ Vertex degree sums for perfect matchings in 3-uniform hypergraphs ⋮ The matching polynomials of hypergraphs and weighted hypergraphs ⋮ \(d\)-matching in 3-uniform hypergraphs ⋮ A note on perfect matchings in uniform hypergraphs ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs ⋮ Matching in 3-uniform hypergraphs ⋮ The complexity of perfect matchings and packings in dense hypergraphs ⋮ Vertex degree sums for matchings in 3-uniform hypergraphs ⋮ Vertex degree sums for matchings in 3-uniform hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved bounds for Erdős' matching conjecture
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Tight co-degree condition for perfect matchings in 4-graphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- Perfect matchings in uniform hypergraphs with large minimum degree
- Perfect matchings in 4-uniform hypergraphs
- A note on perfect matchings in uniform hypergraphs
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Matchings in 3-uniform hypergraphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- On Erdős' extremal problem on matchings in hypergraphs
- Fractional and integer matchings in uniform hypergraphs
- Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
- The Size of a Hypergraph and its Matching Number
- Recent advances on Dirac-type problems for hypergraphs
- Near Perfect Matchings in ${k}$-Uniform Hypergraphs II
- On maximal paths and circuits of graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Embedding large subgraphs into dense graphs
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Near Perfect Matchings ink-Uniform Hypergraphs
- Matchings in hypergraphs of large minimum degree
This page was built for publication: Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture
