Pages that link to "Item:Q2905303"

What links here

⧼whatlinkshere-whatlinkshere-target⧽

Page:

⧼whatlinkshere-whatlinkshere-ns⧽

Namespace:

Invert selection

⧼whatlinkshere-whatlinkshere-filter⧽

Hide transclusions

Hide links

Hide redirects

The following pages link to On edge coloring of hypergraphs and Erdős-Faber-Lovász conjecture (Q2905303):

Displaying 22 items.

New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture (Q503615) (← links)
The Erdős-Faber-Lovász conjecture -- the uniform regular case (Q543987) (← links)
A note on the Erdős--Farber--Lovász conjecture (Q868363) (← links)
Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász (Q1112832) (← links)
Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors (Q1185879) (← links)
A fractional version of the Erdős-Faber-Lovász conjecture (Q1196685) (← links)
The Erdős-Faber-Lovász conjecture for weakly dense hypergraphs (Q2032720) (← links)
Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz (Q2168069) (← links)
On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs (Q2198387) (← links)
Two smaller upper bounds of List injective chromatic number (Q2253957) (← links)
The Erdős-Faber-Lovász conjecture for dense hypergraphs (Q2470471) (← links)
A remark on the conjecture of Erdös, Faber and Lovász (Q2482329) (← links)
Lower bounds on circuit depth of the quantum approximate optimization algorithm (Q2687096) (← links)
On the total chromatic number of Steiner systems (Q2708239) (← links)
On some hypergraph problems of Paul Erdös and the asymptotics of matchings, covers and colorings (Q2785566) (← links)
The Erdős-Faber-Lovász conjecture is true for \(n \leq 12\) (Q2920887) (← links)
(Q3303467) (← links)
The Erdős–Faber–Lovász conjecture for the class of δEFL graphs (Q5013484) (← links)
Further results on Erdős–Faber–Lovász conjecture (Q5154633) (← links)
Edge‐coloring linear hypergraphs with medium‐sized edges (Q5236928) (← links)
The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques (Q5360466) (← links)
Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)