Rainbow spanning structures in graph and hypergraph systems
From MaRDI portal
Publication:6052079
DOI10.1017/fms.2023.92zbMath1525.05094arXiv2105.10219OpenAlexW4387715510MaRDI QIDQ6052079
No author found.
Publication date: 23 October 2023
Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.10219
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On directed versions of the Corrádi-Hajnal corollary
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Rainbow matchings in bipartite multigraphs
- Rainbow matchings in properly-colored hypergraphs
- Asymptotic behavior of the chromatic index for hypergraphs
- Near perfect coverings in graphs and hypergraphs
- Almost \(H\)-factors in dense graphs
- Transversals in row-latin rectangles
- An approximate version of a conjecture of Aharoni and Berger
- Matchings in 3-uniform hypergraphs
- Rainbow matchings for 3-uniform hypergraphs
- Rainbow pancyclicity in graph systems
- The minimum degree threshold for perfect graph packings
- The Erdős matching conjecture and concentration inequalities
- Rainbow factors in hypergraphs
- A multipartite Hajnal-Szemerédi theorem
- 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
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Rainbow Turán Problems
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- Critical chromatic number and the complexity of perfect packings in graphs
- [https://portal.mardi4nfdi.de/wiki/Publication:4261183 Variants of the Hajnal-Szemer�di Theorem]
- On Rainbow Matchings for Hypergraphs
- A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs
- Rainbow Perfect Matchings for 4-Uniform Hypergraphs
- A rainbow version of Mantel's Theorem
- Rainbow Odd Cycles
- An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs
- On Directed Versions of the Hajnal–Szemerédi Theorem
- A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem
- A geometric theory for hypergraph matching
- On the maximal number of independent circuits in a graph
- Some Theorems on Abstract Graphs
- Transversal factors and spanning trees
- Proof of the Alon-Yuster conjecture
This page was built for publication: Rainbow spanning structures in graph and hypergraph systems
