A coloring problem for intersecting vector spaces

DOI10.1016/J.DISC.2016.06.007MaRDI QIDQ738847zbMATH OpenOpenAlexFDO

Authors Carlos Hoppen, Hanno Lefmann, Knut Odermann

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

zbMATH Keywords

stabilitycoloringfinite vector spacesErdős-Ko-Rado theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal set theory (05D05)

Recommendations

• Colourings without monochromatic disjoint pairs
• Hypergraphs with many Kneser colorings
• Kneser colorings of uniform hypergraphs
• Coloring cross-intersecting families
• An unstable hypergraph problem with a unique optimal solution

Cites work

• scientific article; zbMATH DE number 3487496 (Why is no real title available?)
• scientific article; zbMATH DE number 1943959 (Why is no real title available?)
• scientific article; zbMATH DE number 3262986 (Why is no real title available?)
• A Hilton-Milner theorem for vector spaces
• A structural result for hypergraphs with many restricted edge colorings
• An unstable hypergraph problem with a unique optimal solution
• Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs
• Edge-colorings of uniform hypergraphs avoiding monochromatic matchings
• 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 q-analogues and stability theorems
• On colourings of hypergraphs without monochromatic Fano planes
• On intersecting families of finite sets
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• The Erdős-Ko-Rado theorem for vector spaces
• The maximum number of \(K_{3}\)-free and \(K_{4}\)-free edge 4-colorings

Cited in

(11)

• Colouring multijoints
• Colourings without monochromatic disjoint pairs
• Colouring set families without monochromatic \(k\)-chains
• Integer colorings with forbidden rainbow sums
• An unstable hypergraph problem with a unique optimal solution
• Rainbow Erdös-Rothschild problem for the Fano plane
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
• Coloring Euclidean spaces so that all translates of a given set are rainbow
• On the maximum number of integer colourings with forbidden monochromatic sums
• Intercalate coloring of matrices and the Yuzvinsky conjecture
• Stability for the Erdős-Rothschild problem

This page was built for publication: A coloring problem for intersecting vector spaces

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