Color-bias perfect matchings in hypergraphs

DOI10.1137/24M170483XMaRDI QIDQ6918443zbMATH OpenFDO

Authors Hiệp Hàn, Richard Lang, Matías Pavez-Signé, Nicolás Sanhueza-Matamala, Andrew Treglown, Camila Zárate-Guerén

Publication date 10 October 2025

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/24M170483X

zbMATH Keywords

color-biasdiscrepancyperfect matchings

Mathematics Subject Classification ID

Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A discrepancy version of the Hajnal-Szemerédi theorem
• A note on color-bias Hamilton cycles in dense graphs
• A note on color-bias perfect matchings in hypergraphs
• A Remark on Stirling's Formula
• An approximate Dirac-type theorem for k-uniform hypergraphs
• Color‐biased Hamilton cycles in random graphs
• Discrepancies of spanning trees and Hamilton cycles
• Factors in random graphs
• scientific article; zbMATH DE number 3186884 (Why is no real title available?)
• Imbalances in k‐colorations
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• Minimum degree threshold for \(H\)-factors with high discrepancy
• Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
• On perfect matchings in uniform hypergraphs with large minimum vertex degree
• On the discrepancies of graphs
• Perfect matchings in 4-uniform hypergraphs
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Powers of Hamilton cycles of high discrepancy are unavoidable
• Recent advances on Dirac-type problems for hypergraphs
• Tight Hamilton cycles with high discrepancy

This page was built for publication: 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 Q6918443)