Pages that link to "Item:Q6093285"

The following pages link to A proof of the Erdős-Faber-Lovász conjecture (Q6093285):

Displaying 20 items.

• The Erdős-Faber-Lovász conjecture -- the uniform regular case (Q543987) (← links)
• Proof of a conjecture by Erdős and Graham concerning the problem of Frobenius (Q909697) (← links)
• A fractional version of the Erdős-Faber-Lovász conjecture (Q1196685) (← links)
• A proof of Pyber's base size conjecture (Q1647396) (← links)
• Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem (Q1850610) (← links)
• A proof of Erdős-Fishburn's conjecture for \(g(6)=13\) (Q1953348) (← 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)
• Fractional aspects of the Erdős-Faber-Lovász conjecture (Q2259581) (← 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)
• The Erdős-Faber-Lovász conjecture is true for \(n \leq 12\) (Q2920887) (← links)
• (Q4023746) (← links)
• A Short Proof of the Erdos-Mordell Theorem (Q4340073) (← links)
• (Q6076845) (← links)
• Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
• Coloring unions of nearly disjoint hypergraph cliques (Q6144279) (← links)
• Ramsey numbers for multiple copies of sparse graphs (Q6565813) (← links)
• A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree (Q6632801) (← links)
• Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree (Q6659522) (← links)