A note on color-bias perfect matchings in hypergraphs
From MaRDI portal
Publication:6622736
DOI10.1137/24M1637350MaRDI QIDQ6622736
Andrew Treglown, Camila Zárate-Guerén, József Balogh
Publication date: 22 October 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Perfect matchings in uniform hypergraphs with large minimum degree
- 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
- Powers of Hamilton cycles of high discrepancy are unavoidable
- On the discrepancies of graphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- Discrepancies of spanning trees and Hamilton cycles
- Recent advances on Dirac-type problems for hypergraphs
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Embedding large subgraphs into dense graphs
- A Note on Color-Bias Hamilton Cycles in Dense Graphs
- A discrepancy version of the Hajnal–Szemerédi theorem
- Matchings in hypergraphs of large minimum degree
- Color‐biased Hamilton cycles in random graphs
- Minimum degree threshold for \(H\)-factors with high discrepancy
This page was built for publication: A note on color-bias perfect matchings in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6622736)
