A structural result for hypergraphs with many restricted edge colorings

DOI10.4310/JOC.2010.V1.N4.A4MaRDI QIDQ547872zbMATH OpenWikidataFDO

Authors Hanno Lefmann, Yury Person, M. Schacht

Publication date 27 June 2011

Published in Journal of Combinatorics (Search for Journal in Brave)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• Exact results on the number of restricted edge colorings for some families of linear hypergraphs
• Edge-colorings of uniform hypergraphs avoiding monochromatic matchings
• On colourings of hypergraphs without monochromatic Fano planes
• Edge coloring complete uniform hypergraphs with many components
• Colorings of hypergraphs with large number of colors

Cited in

(20)

• Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
• Edge-colorings of uniform hypergraphs avoiding monochromatic matchings
• Maximum number of sum-free colorings in finite abelian groups
• Stability for the Erdős-Rothschild problem
• Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph
• On colourings of hypergraphs without monochromatic Fano planes
• Stability of extremal hypergraphs with applications to an edge-coloring problem
• Hypergraphs with many Kneser colorings
• Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
• A rainbow Erdös-Rothschild problem
• A coloring problem for intersecting vector spaces
• Colouring set families without monochromatic \(k\)-chains
• Rainbow Erdös-Rothschild problem for the Fano plane
• 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
• Restricted extension of sparse partial edge colorings of hypercubes
• Colourings without monochromatic disjoint pairs
• On the maximum number of integer colourings with forbidden monochromatic sums

This page was built for publication: A structural result for hypergraphs with many restricted edge colorings

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