ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE (Q2905303): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
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: Q4653767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic index of cyclic Steiner 2-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combinatorial problems which I would most like to see solved / 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 clone-theoretic formulation of the Erdős-Faber-Lovász conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Conjecture of Erdös, Faber, and Lovász about <i>n</i>-Colorings / 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: A fractional version of the Erdős-Faber-Lovász conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on the conjecture of Erdös, Faber and Lovász / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Faber-Lovász conjecture for dense hypergraphs / rank
 
Normal rank

Revision as of 14:08, 5 July 2024

scientific article
Language Label Description Also known as
English
ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE
scientific article

    Statements

    Identifiers