e/Lovasz conjecture

Information
has gloss	eng: In graph theory, the Lovász conjecture (1970) is a classical problem on Hamiltonian paths in graphs. It says: : Every finite connected vertex-transitive graph contains a Hamiltonian path. The original article of Lovász stated the result in the opposite, but this version became standard. In 1996 Babai published a conjecture sharply contradicting this conjecture , but both conjectures remain widely open. It is not even known if a single counterexample would necessarily lead to a series of counterexamples.
lexicalization	eng: Lovasz conjecture
lexicalization	eng: Lovász conjecture
instance of	(noun) a hypothesis that has been formed by speculating or conjecturing (usually with little hard evidence); "speculations about the outcome of the election"; "he dismissed it as mere conjecture" conjecture, speculation

Meaning
Hungarian
has gloss	hun: A Lovász-sejtés a matematika, konkrétabban a gráfelmélet egyik nyitott kérdése. Így szól: : Minden véges, összefüggő csúcstranzitív gráfban létezik Hamilton-út.
lexicalization	hun: Lovász sejtés
lexicalization	hun: Lovász-sejtés