New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture (Q503615): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4294445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3360903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Colour Numbers of Complete Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4237674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Faber-Lovász conjecture -- the uniform regular case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Erdős--Farber--Lovász conjecture / 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: Q5342914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős–Faber–Lovász conjecture is true for n ≤ 12 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070194 / 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 note on Erd\"os-Faber-Lov\'asz Conjecture and edge coloring of complete graphs / rank
 
Normal rank

Latest revision as of 06:48, 13 July 2024

scientific article
Language Label Description Also known as
English
New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture
scientific article

    Statements

    New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture (English)
    0 references
    0 references
    0 references
    13 January 2017
    0 references
    linear hypergraph
    0 references
    \(n\)-cluster
    0 references
    strong vertex coloring
    0 references
    chromatic number
    0 references
    edge coloring
    0 references
    chromatic index
    0 references

    Identifiers