Edge-colorings of uniform hypergraphs avoiding monochromatic matchings

DOI10.1016/J.DISC.2014.10.004MaRDI QIDQ472979zbMATHOpenAlexDBLPWikidataFDO

Authors Carlos Hoppen, Hanno Lefmann, 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

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

Recommendations

• Edge colourings of graphs avoiding monochromatic matchings of a given size
• Exact results on the number of restricted edge colorings for some families of linear hypergraphs
• A structural result for hypergraphs with many restricted edge colorings
• Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs
• Monochromatic matchings in the shadow graph of almost complete hypergraphs

Cites work

• scientific article; zbMATH DE number 5942358 (Why is no real title available?)
• scientific article; zbMATH DE number 881297 (Why is no real title available?)
• scientific article; zbMATH DE number 3221072 (Why is no real title available?)
• A structural result for hypergraphs with many restricted edge colorings
• Edge colourings of graphs avoiding monochromatic matchings of a given size
• Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
• Exact results on the number of restricted edge colorings for some families of linear hypergraphs
• Hypergraphs with many Kneser colorings
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On colourings of hypergraphs without monochromatic Fano planes
• On maximal paths and circuits of graphs
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• The maximum number of \(K_{3}\)-free and \(K_{4}\)-free edge 4-colorings

Cited in

(19)

• Avoiding and extending partial edge colorings of hypercubes
• Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
• Edge-colorings avoiding a fixed matching with a prescribed color pattern
• Colorations Extrêmes Dans Les Hypergraphes
• Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph
• Hypergraphs with many Kneser colorings
• Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
• A structural result for hypergraphs with many restricted edge colorings
• A coloring problem for intersecting vector spaces
• Kneser colorings of uniform hypergraphs
• Colouring set families without monochromatic \(k\)-chains
• Integer colorings with forbidden rainbow sums
• Edge colourings of graphs avoiding monochromatic matchings of a given size
• Exact results on the number of restricted edge colorings for some families of linear hypergraphs
• The maximum number of cliques in hypergraphs without large matchings
• Colourings without monochromatic disjoint pairs
• Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs
• scientific article; zbMATH DE number 3708458 (Why is no real title available?)
• Monochromatic matchings in the shadow graph of almost complete hypergraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472979)