Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A linear hypergraph is intersecting if any two different edges have exactly one common vertex and an $n$-quasicluster is an… Expand
  • figure 1
  • figure 2
  • figure 3
2012
2012
The celebrated Erdos–Faber–Lovasz conjecture originated in the year 1972. It can be stated as follows: any linear hypergraph on n… Expand
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… Expand
2009
2009
This paper lays the foundation for a theory of combinatorial groupoids that allows us to use concepts like “holonomy”, “parallel… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Review
2009
Review
2009
The classical question raised by Lovasz asks whether every Cayley graph is Hamiltonian. We present a short survey of various… Expand
2009
2009
In this article current directions in solving Lovasz's problem about the existence of Hamilton cycles and paths in connected… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2008
2008
A hypergraph, having n edges, is linear if no two distinct edges intersect in more than one vertex, and is dense if its minimum… Expand
2007
2007
A hypergraph H is linear if no two distinct edges of H intersect in more than one vertex and loopless if no edge has size one. A… Expand
Highly Cited
2004
Highly Cited
2004
To any two graphs G and H one can associate a cell complex Horn (G, H) by taking all graph multihomomorphisms from G to H as… Expand
  • figure 3.1
  • figure 4.1
  • figure 4.2
  • figure 4.3
  • figure 4.4
1992
1992
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… Expand