Co-degree threshold for rainbow perfect matchings in uniform hypergraphs

DOI10.1016/j.jctb.2023.07.003zbMath1521.05165arXiv2111.00372MaRDI QIDQ6051049

Publication date: 19 September 2023

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.00372

zbMATH Keywords

absorbing method rainbow matching co-degree threshold

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

Unnamed Item
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
Perfect matchings in uniform hypergraphs with large minimum degree
Perfect matchings in 4-uniform hypergraphs
Perfect matchings in large uniform hypergraphs with large minimum collective degree
Matchings in 3-uniform hypergraphs
Rainbow matchings for 3-uniform hypergraphs
On the rainbow matching conjecture for 3-uniform hypergraphs
The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture
A better bound on the size of rainbow matchings
Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
The Size of a Hypergraph and its Matching Number
On a rainbow version of Dirac's theorem
On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
On the size of graphs with complete-factors
SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
Almost Perfect Matchings in $k$-Partite $k$-Graphs
Rainbow matchings in k‐partite hypergraphs
Reducibility among Combinatorial Problems
Rainbow Perfect Matchings for 4-Uniform Hypergraphs
Simple juntas for shifted families
Paths, Trees, and Flowers
Near Perfect Matchings ink-Uniform Hypergraphs
A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem
Matchings in hypergraphs of large minimum degree
Rainbow version of the Erdős Matching Conjecture via concentration
Hypercontractivity for global functions and sharp thresholds

This page was built for publication: Co-degree threshold for rainbow perfect matchings in uniform hypergraphs