Edge‐coloring linear hypergraphs with medium‐sized edges (Q5236928): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Coloring graphs with sparse neighborhoods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically good list-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3447292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Faber-Lovász conjecture for dense hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs / rank
 
Normal rank

Latest revision as of 16:16, 20 July 2024

scientific article; zbMATH DE number 7118077
Language Label Description Also known as
English
Edge‐coloring linear hypergraphs with medium‐sized edges
scientific article; zbMATH DE number 7118077

    Statements

    Edge‐coloring linear hypergraphs with medium‐sized edges (English)
    0 references
    0 references
    0 references
    16 October 2019
    0 references
    chromatic index
    0 references
    EFL
    0 references
    linear hypergraph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references