A structural result for hypergraphs with many restricted edge colorings

DOI10.4310/JOC.2010.v1.n4.a4zbMath1244.05160WikidataQ105584507 ScholiaQ105584507MaRDI QIDQ547872

Yury Person, Mathias Schacht, Hanno Lefmann

Publication date: 27 June 2011

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

Mathematics Subject Classification ID

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

Related Items (17)

Edge-colorings of graphs avoiding complete graphs with a prescribed coloring ⋮ Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size ⋮ Stability for the Erdős-Rothschild problem ⋮ Maximum number of sum-free colorings in finite abelian groups ⋮ On the maximum number of integer colourings with forbidden monochromatic sums ⋮ Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph ⋮ Integer colorings with forbidden rainbow sums ⋮ Hypergraphs with many Kneser colorings ⋮ A Rainbow Erdös--Rothschild Problem ⋮ The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques ⋮ Edge-colorings of uniform hypergraphs avoiding monochromatic matchings ⋮ Colourings without monochromatic disjoint pairs ⋮ Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs ⋮ Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number ⋮ Rainbow Erdös--Rothschild Problem for the Fano Plane ⋮ A coloring problem for intersecting vector spaces ⋮ Colouring set families without monochromatic \(k\)-chains

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