# Lovász conjecture

Known as: Lovasz conjecture, Lovász
In graph theory, the Lovász conjecture (1969) is a classical problem on Hamiltonian paths in graphs. It says: Every finite connected vertex…
Wikipedia (opens in a new tab)

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
• 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…
2012
2012
• Discret. Math. Algorithms Appl.
• 2012
• Corpus ID: 12749078
The celebrated Erdos–Faber–Lovasz conjecture originated in the year 1972. It can be stated as follows: any linear hypergraph on n…
Highly Cited
2011
Highly Cited
2011
• Xuding Zhu
• European journal of combinatorics (Print)
• 2011
• Corpus ID: 29046023
2010
2010
We consider the Erdős-Faber-Lovász (EFL) conjecture for hypergraphs that are both regular and uniform. This paper proves that for…
2009
Review
2009
Review
2009
• Discrete Mathematics
• 2009
• Corpus ID: 1708304
Highly Cited
2009
Highly Cited
2009
2005
2005
• 2005
• Corpus ID: 7412540
To any two graphs G and H one can associate a cell complex Hom (G, H) by taking all graph multihomorphisms from G to H as cells…
2004
2004
• Discuss. Math. Graph Theory
• 2004
• Corpus ID: 28999310
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…
1992
1992
• Comb.
• 1992
• Corpus ID: 6144958
LetH be any hypergraph in which any two edges have at most one vertex in common. We prove that one can assign non-negative real…