Skip to search formSkip to main contentSkip to account menu

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)

Related topics

Related topics

7 relations

Broader (2)

Algebraic graph theoryGraph theory
Cube-connected cyclesHamiltonian pathSteinhaus–Johnson–Trotter algorithmThe Art of Computer Programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A new minimal chordal completion
In this paper, we present a minimal chordal completion $G^*$ of a graph $G$ satisfying the inequality $\omega(G^*) - \omega(G… 
2017
2017
On Erdos-Faber-Lovasz Conjecture
In 1972, Erdos - Faber - Lovasz (EFL) conjectured that, if $\textbf{H}$ is a linear hypergraph consisting of $n$ edges of… 
2016
2016
A note on Erdos-Faber-Lovasz Conjecture and edge coloring of complete graphs
A linear hypergraph is intersecting if any two different edges have exactly one common vertex and an $n$-quasicluster is an… 
2012
2012
On Edge Coloring of Hypergraphs and ERDöS-Faber-LováSZ Conjecture
The celebrated Erdos–Faber–Lovasz conjecture originated in the year 1972. It can be stated as follows: any linear hypergraph on n… 
2010
2010
The Erdös-Faber-Lovász conjecture – the uniform regular case
We consider the Erdős-Faber-Lovász (EFL) conjecture for hypergraphs that are both regular and uniform. This paper proves that for… 
Highly Cited
2005
Highly Cited
2005
Complexes of directed trees and independence complexes
2005
2005
Independence complexes of claw-free graphs
2004
2004
A clone-theoretic formulation of the Erdös-Faber-Lovász conjecture
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… 
2004
2004
Proof of the Lov´asz Conjecture
In this paper we prove the Lovász Conjecture: If Hom (C2r+1, H) is k-connected, then χ(H) ≥ k + 4, where H is a finite undirected… 
1992
1992
A fractional version of the Erdős-Faber-Lovász conjecture
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… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)