Erdős–Faber–Lovász conjecture

Known as: Erdos-Faber-Lovász conjecture, Erdős-Faber-Lovász conjecture, Erdös-Faber-Lovász conjecture 
In graph theory, the Erdős–Faber–Lovász conjecture is an unsolved problem about graph coloring, named after Paul Erdős, Vance Faber, and László Lov… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The Erdős-Faber-Lovász conjecture is the statement that every graph that is the union of n cliques of size n intersecting… (More)
Is this relevant?
2014
2014
In 1972, Paul Erdős, Vance Faber, and László Lovász conjectured: “if |Ak| = n, 1 ≤ k ≤ n, and |Ak ∩ Aj | ≤ 1, for k < j ≤ n, then… (More)
  • figure 1
  • table 1
Is this relevant?
2013
2013
The b-chromatic number χb(G) of a graph G is themaximum k for which there is a function c: V (G) → {1, 2, . . . , k} such that c… (More)
  • figure 1
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2006
2006
Human intelligence has evolved along with the use of more and more sophisticated tools, allowing Homo Faber (from Homo Habilis to… (More)
  • figure 1
Is this relevant?
2005
2005
K e y w o r d s O p t i m a l triangulation, Centroidal Voronoi Tessellation, Gersho's conjecture, Optimal vector quantizer, Mesh… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
2004
2004
The Erdős–Faber–Lovász conjecture states that if a graph G is the union of n cliques of size n no two of which share more than… (More)
Is this relevant?
2000
2000
Let γ(G) denote the domination number of a graph G and let G H denote the Cartesian product of graphs G and H. We prove that γ(G… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The uniform spanning tree (UST) and the loop-erased random walk (LERW) are strongly related probabilistic processes. We consider… (More)
  • figure 1.1
  • figure 8.1
  • figure 10.1
Is this relevant?
1999
1999
Clemens has conjectured that a generic sextic threefold contains no rational curves. Here we prove a generalization of this… (More)
Is this relevant?
1990
1990
The famous conjecture of ErdBs, Faber, and Lovasz (see, e.g., [2]) states that if the edge set of a graph G can be covered with n… (More)
Is this relevant?