Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,612,604 papers from all fields of science
Search
Sign In
Create Free Account
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
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
B-coloring
Clique (graph theory)
Edge coloring
Fractional coloring
Expand
Broader (1)
Graph coloring
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A new minimal chordal completion
Jihoon Choi
,
Soogang Eoh
,
Suh-Ryung Kim
2018
Corpus ID: 119136810
In this paper, we present a minimal chordal completion $G^*$ of a graph $G$ satisfying the inequality $\omega(G^*) - \omega(G…
Expand
2017
2017
On Erdos-Faber-Lovasz Conjecture
S. M. Hegde
,
Suresh Dara
2017
Corpus ID: 119247521
In 1972, Erdos - Faber - Lovasz (EFL) conjectured that, if $\textbf{H}$ is a linear hypergraph consisting of $n$ edges of…
Expand
2016
2016
A note on Erdos-Faber-Lovasz Conjecture and edge coloring of complete graphs
G. Araujo-Pardo
,
A. Vázquez-Ávila
Ars Comb.
2016
Corpus ID: 7097313
A linear hypergraph is intersecting if any two different edges have exactly one common vertex and an $n$-quasicluster is an…
Expand
2016
2016
The Erdős-Faber-Lovász conjecture for geometric graphs
C. Huemer
,
D. Lara
,
Christian Rubio-Montiel
2016
Corpus ID: 125812316
2015
2015
Note on the Erdos-Faber-Lovasz Conjecture and commutative quasigroups
G. Araujo-Pardo
,
Christian Rubio-Montiel
,
A. Vázquez-Ávila
2015
Corpus ID: 123305143
A decomposition of a simple graph $G$ is a pair $(G,D)$ where $D$ is a set of subgraphs of $G$, which partitions the edges of $G…
Expand
2012
2012
Solution for Erdős–Faber–Lovász Conjecture
Wilber Valgusbitkevyt
2012
Corpus ID: 118217506
Translate the graph into sets by using the shared vertexes as indexes. Then consider several different cases to see how the…
Expand
2010
2010
On the Erdos-Faber-Lovasz Conjecture
J. Mitchem
,
Randolph L. Schmidt
Ars Comb.
2010
Corpus ID: 46621747
2007
2007
Adding evidence to the Erdos-Faber-Lovasz conjecture
David Romero
,
Abdón Sánchez-Arroyo
Ars Comb.
2007
Corpus ID: 32144312
2000
2000
Homo Faber, Homo Sapiens, or Homo Politicus? Protagoras and the Myth of Prometheus
A. Ferrarin
2000
Corpus ID: 169177343
I WHEN NIETZSCHE CALLED MAN THE YET UNFINISHED ANIMAL, he echoed a phrase that had remote origins. In classical German philosophy…
Expand
1993
1993
05. Observations on the reproductive behaviour of the Smith Frog Hyla Jaber
M. Martins
1993
Corpus ID: 196614699
The reproductive behaviour of the Smith Frog, Hyla f aber, was studied in an artificial pennanent pond in southeastern Brazil…
Expand