Fractional and integer matchings in uniform hypergraphs
From MaRDI portal
Publication:2637239
DOI10.1016/j.ejc.2013.11.006zbMath1282.05172arXiv1304.6901OpenAlexW2054420934MaRDI QIDQ2637239
Deryk Osthus, Timothy Townsend, Daniela Kühn
Publication date: 10 February 2014
Published in: European Journal of Combinatorics, The Seventh European Conference on Combinatorics, Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.6901
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)
Related Items (18)
Perfect packings in quasirandom hypergraphs. I. ⋮ 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 ⋮ Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture ⋮ Near Perfect Matchings in ${k}$-Uniform Hypergraphs II ⋮ Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture ⋮ The Erdős matching conjecture and concentration inequalities ⋮ Vertex degree sums for perfect matchings in 3-uniform hypergraphs ⋮ On vertex independence number of uniform hypergraphs ⋮ Improved bound on vertex degree version of Erdős matching conjecture ⋮ \(d\)-matching in 3-uniform hypergraphs ⋮ A note on perfect matchings in uniform hypergraphs ⋮ Perfect Packings in Quasirandom Hypergraphs II ⋮ Note on matchings in 3-partite 3-uniform hypergraphs ⋮ Matching in 3-uniform hypergraphs ⋮ The complexity of perfect matchings and packings in dense hypergraphs ⋮ Nearly Perfect Matchings in 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
- 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
- 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
- Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
- On maximal paths and circuits of graphs
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Embedding large subgraphs into dense graphs
- Degrees giving independent edges in a hypergraph
- Regularity lemmas for hypergraphs and quasi-randomness
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Matchings in hypergraphs of large minimum degree
- Polynomial-time perfect matchings in dense hypergraphs
This page was built for publication: Fractional and integer matchings in uniform hypergraphs
