Pages that link to "Item:Q1196685"

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

Displaying 19 items.

• The fractional version of Hedetniemi's conjecture is true (Q648973) (← links)
• On topological relaxations of chromatic conjectures (Q710730) (← links)
• A problem of Füredi and Seymour on covering intersecting families by pairs (Q1337172) (← 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)
• Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
• On some hypergraph problems of Paul Erdös and the asymptotics of matchings, covers and colorings (Q2785566) (← links)
• On edge coloring of hypergraphs and Erdős-Faber-Lovász conjecture (Q2905303) (← links)
• A counterexample to Borsuk’s conjecture (Q3138089) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• The Erdős–Faber–Lovász conjecture for the class of δEFL graphs (Q5013484) (← links)
• The Erd\H{o}s--Faber--Lov\'{a}sz Conjecture revisited (Q5027676) (← links)
• A note on fractional covers of a graph (Q5058159) (← links)
• Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
• (Q6076845) (← links)
• Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
• A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
• Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree (Q6659522) (← links)