Perfect matchings in shadow colorings

DOI10.1007/S10474-020-01031-8zbMath1474.05133OpenAlexW3014945616MaRDI QIDQ2220968

Yanyan Li

Publication date: 25 January 2021

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10474-020-01031-8

zbMATH Keywords

edge coloring of hypergraphsmonochromatic matching

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Cites Work

• Coverings by few monochromatic pieces: a transition between two Ramsey problems
• Monochromatic matchings in the shadow graph of almost complete hypergraphs
• Monochromatic Hamiltonian Berge-cycles in colored hypergraphs
• Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs

This page was built for publication: Perfect matchings in shadow colorings