A coloring problem for intersecting vector spaces
From MaRDI portal
Publication:738847
DOI10.1016/J.DISC.2016.06.007zbMath1343.05154OpenAlexW2464999979MaRDI QIDQ738847
Knut Odermann, Carlos Hoppen, Hanno Lefmann
Publication date: 16 August 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.06.007
Related Items (7)
Stability for the Erdős-Rothschild problem ⋮ On the maximum number of integer colourings with forbidden monochromatic sums ⋮ Integer colorings with forbidden rainbow sums ⋮ The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques ⋮ Colourings without monochromatic disjoint pairs ⋮ Rainbow Erdös--Rothschild Problem for the Fano Plane ⋮ Colouring set families without monochromatic \(k\)-chains
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(q\)-analogues and stability theorems
- Hypergraphs with many Kneser colorings
- Edge-colorings of uniform hypergraphs avoiding monochromatic matchings
- A structural result for hypergraphs with many restricted edge colorings
- A Hilton-Milner theorem for vector spaces
- The Erdős-Ko-Rado theorem for vector spaces
- Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs
- The maximum number of K 3 -free and K 4 -free edge 4-colorings
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On Colourings of Hypergraphs Without Monochromatic Fano Planes
- THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
- An Unstable Hypergraph Problem with a Unique Optimal Solution
- Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On intersecting families of finite sets
This page was built for publication: A coloring problem for intersecting vector spaces
