A coloring problem for intersecting vector spaces (Q738847): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2016.06.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2464999979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hilton-Milner theorem for vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(q\)-analogues and stability theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4410007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On intersecting families of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Ko-Rado theorem for vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs with many Kneser colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Unstable Hypergraph Problem with a Unique Optimal Solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colorings of uniform hypergraphs avoiding monochromatic matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Colourings of Hypergraphs Without Monochromatic Fano Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structural result for hypergraphs with many restricted edge colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of <i>K</i> <sub>3</sub> -free and <i>K</i> <sub>4</sub> -free edge 4-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs / rank
 
Normal rank

Latest revision as of 11:15, 12 July 2024

scientific article
Language Label Description Also known as
English
A coloring problem for intersecting vector spaces
scientific article

    Statements

    A coloring problem for intersecting vector spaces (English)
    0 references
    0 references
    0 references
    0 references
    16 August 2016
    0 references
    finite vector spaces
    0 references
    Erdős-Ko-Rado theorem
    0 references
    coloring
    0 references
    stability
    0 references

    Identifiers