A coloring problem for intersecting vector spaces
type: Item
instance of: scholarly article
title: A coloring problem for intersecting vector spaces
zbMATH Open document ID: 1343.05154
author: Carlos Hoppen
author: Hanno Lefmann
author: Knut Odermann
published in: Discrete Mathematics
publication date: 2016-08-16T00:00:00Z
Mathematics Subject Classification ID: 05D05
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6617190
zbMATH Keywords: finite vector spaces
zbMATH Keywords: Erdős-Ko-Rado theorem
zbMATH Keywords: coloring
zbMATH Keywords: stability
MaRDI profile type: Publication
full work available at URL: j.disc.2016.06.007
OpenAlex ID: W2464999979
cites work: THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
cites work: A Hilton-Milner theorem for vector spaces
cites work: On \(q\)-analogues and stability theorems
cites work: Q4410007
cites work: Q4071278
cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: On intersecting families of finite sets
cites work: The Erdős-Ko-Rado theorem for vector spaces
cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: Hypergraphs with many Kneser colorings
cites work: An Unstable Hypergraph Problem with a Unique Optimal Solution
cites work: Edge-colorings of uniform hypergraphs avoiding monochromatic matchings
cites work: Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs
cites work: On Colourings of Hypergraphs Without Monochromatic Fano Planes
cites work: A structural result for hypergraphs with many restricted edge colorings
cites work: The maximum number of \(K_{3}\)-free and \(K_{4}\)-free edge 4-colorings
cites work: Q5548826
cites work: Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs
DOI: 10.1016/J.DISC.2016.06.007
description: scientific article; zbMATH DE number 6617190