# Erdős–Faber–Lovász conjecture

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- Discussiones Mathematicae Graph Theory
- 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

- Discrete Math., Alg. and Appl.
- 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)

Is this relevant?

2013

2013

- Discrete Applied Mathematics
- 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)

Is this relevant?

2006

2006

- Electr. Notes Theor. Comput. Sci.
- 2006

Human intelligence has evolved along with the use of more and more sophisticated tools, allowing Homo Faber (from Homo Habilis to… (More)

Is this relevant?

2005

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)

Is this relevant?

2004

2004

- Discussiones Mathematicae Graph Theory
- 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

- Electr. J. Comb.
- 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

- 1999

The uniform spanning tree (UST) and the loop-erased random walk (LERW) are strongly related probabilistic processes. We consider… (More)

Is this relevant?

1999

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

- J. Comb. Theory, Ser. B
- 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?