scholarly journals The Erdős–Faber–Lovász conjecture for weakly dense hypergraphs

2021 ◽  
Vol 344 (7) ◽  
pp. 112401
Author(s):  
Guillermo Alesandroni
Keyword(s):  
Lovász Conjecture

A clone-theoretic formulation of the Erdős-Faber-Lovász conjecture

2004 ◽  
Vol 24 (3) ◽  
pp. 545 ◽  
Author(s):  
Lucien Haddad ◽  
Claude Tardif
Keyword(s):  
Lovász Conjecture

The Erdős–Faber–Lovász conjecture for the class of δEFL graphs

2020 ◽  
pp. 2150034
Author(s):  
R. Dharmarajan ◽  
D. Ramachandran
Keyword(s):  
Graph Class ◽  
Lovász Conjecture ◽  
Generalized Statement

In this paper, we present the class of [Formula: see text] graphs and then prove a generalized statement of the Erdős–Faber–Lovász conjecture for this graph class. Then, the Erdős–Faber–Lovász conjecture follows for every graph in this class.

A fractional version of the Erdős-Faber-Lovász conjecture

COMBINATORICA ◽  
1992 ◽  
Vol 12 (2) ◽  
pp. 155-160 ◽  
Author(s):  
Jeff Kahn ◽  
P. D. Seymour
Keyword(s):  
Lovász Conjecture

scholarly journals A note on the Erdős–Farber–Lovász conjecture

2007 ◽  
Vol 307 (7-8) ◽  
pp. 911-915 ◽  
Author(s):  
Bill Jackson ◽  
G. Sethuraman ◽  
Carol Whitehead
Keyword(s):  
Lovász Conjecture

The Erdős–Faber–Lovász conjecture is true for n ≤ 12

2014 ◽  
Vol 06 (03) ◽  
pp. 1450039 ◽  
Author(s):  
David Romero ◽  
Federico Alonso-Pecina
Keyword(s):  
Chromatic Number ◽  
Lovász Conjecture

The unsolved Erdős–Faber–Lovász conjecture states that if a hypergraph has n edges, each of size n, and every pair of edges intersect in at most one vertex, then its vertex chromatic number is equal to n. Hindman proved it for n ≤ 10; here we extend this result up to n ≤ 12.

Sign in / Sign up

Export Citation Format

Share Document