Edge-colorings of uniform hypergraphs avoiding monochromatic matchings

DOI10.1016/J.DISC.2014.10.004zbMath1303.05062DBLPjournals/dm/HoppenKL15OpenAlexW2084962005WikidataQ101496286 ScholiaQ101496286MaRDI QIDQ472979

Hanno Lefmann, Carlos Hoppen, Yoshiharu Kohayakawa

Publication date: 20 November 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.10.004

zbMATH Keywords

hypergraphsedge coloringsintersecting set families

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)

Related Items (5)

Edge-colorings of graphs avoiding complete graphs with a prescribed coloring ⋮ Integer colorings with forbidden rainbow sums ⋮ Colourings without monochromatic disjoint pairs ⋮ A coloring problem for intersecting vector spaces ⋮ Colouring set families without monochromatic \(k\)-chains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypergraphs with many Kneser colorings
• A structural result for hypergraphs with many restricted edge colorings
• Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
• Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size
• The maximum number of K ₃ -free and K ₄ -free edge 4-colorings
• On maximal paths and circuits of graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On Colourings of Hypergraphs Without Monochromatic Fano Planes
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs

This page was built for publication: Edge-colorings of uniform hypergraphs avoiding monochromatic matchings