A structural result for hypergraphs with many restricted edge colorings
From MaRDI portal
Publication:547872
DOI10.4310/JOC.2010.V1.N4.A4zbMATH Open1244.05160WikidataQ105584507 ScholiaQ105584507MaRDI QIDQ547872FDOQ547872
Authors: Hanno Lefmann, Yury Person, M. Schacht 
Publication date: 27 June 2011
Published in: Journal of Combinatorics (Search for Journal in Brave)
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 complete graphs with a prescribed coloring
- Hypergraphs with many Kneser colorings
- Colourings without monochromatic disjoint pairs
- Restricted extension of sparse partial edge colorings of hypercubes
- Colouring set families without monochromatic \(k\)-chains
- Integer colorings with forbidden rainbow sums
- On colourings of hypergraphs without monochromatic Fano planes
- Exact results on the number of restricted edge colorings for some families of linear hypergraphs
- A coloring problem for intersecting vector spaces
- Rainbow Erdös-Rothschild problem for the Fano plane
- Maximum number of sum-free colorings in finite abelian groups
- Edge-colorings of uniform hypergraphs avoiding monochromatic matchings
- The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
- Edge colourings of graphs avoiding monochromatic matchings of a given size
- Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
- Stability of extremal hypergraphs with applications to an edge-coloring problem
- On the maximum number of integer colourings with forbidden monochromatic sums
- Stability for the Erdős-Rothschild problem
- A rainbow Erdös-Rothschild problem
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)
