In graph theory, the Lovász conjecture (1969) is a classical problem on Hamiltonian paths in graphs. It says: Every finite connected vertex-transitive...

theory, the Erdős–Faber–Lovász conjecture is a problem about graph coloring, named after Paul Erdős, Vance Faber, and László Lovász, who formulated it in...

formulation of the Erdős–Faber–Lovász conjecture. He is also one of the eponymous authors of the LLL lattice reduction algorithm. Lovász was born on March 9, 1948...

in combinatorics Lovász conjecture (1970) Erdős–Faber–Lovász conjecture (1972) The Lovász local lemma (proved in 1975, by László Lovász & P. Erdős) The...

conjecture Kelvin's conjecture Kouchnirenko's conjecture Mertens conjecture Pólya conjecture, 1919 (1958) Ragsdale conjecture Schoenflies conjecture (disproved...

In graph theory, the Lovász–Woodall conjecture is a long-standing problem on cycles in graphs. It says: If G is a k-connected graph and L is a set of...

in 1978. The Erdős–Lovász conjecture on weak/strong delta-systems, proved by Michel Deza in 1974. The Erdős–Heilbronn conjecture in combinatorial number...

(For more information on Hamiltonian paths in Cayley graphs, see the Lovász conjecture.) Cayley graphs on nilpotent groups with cyclic commutator subgroup...

Erdős–Faber–Lovász conjecture on coloring unions of cliques The graceful tree conjecture that every tree admits a graceful labeling Rosa's conjecture that all...

In mathematics, the Mertens conjecture is the statement that the Mertens function M ( n ) {\displaystyle M(n)} is bounded by ± n {\displaystyle \pm {\sqrt...

The Lenstra–Lenstra–Lovász (LLL) lattice basis reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik...

chromatic number. The Erdős–Faber–Lovász conjecture relates graph coloring to cliques. The Erdős–Hajnal conjecture states that families of graphs defined...

simplicial polytopes: it follows in this case from a conjecture of Imre Bárány and László Lovász (1982) that every centrally symmetric simplicial polytope...

graph is a counterexample to a variant of the Lovász conjecture, but the canonical formulation of the conjecture asks for a Hamiltonian path and is verified...

2019, an approximate version of the conjecture has been disproved. List of unsolved problems in computer science Lovász, László; Saks, Michael (1988), Möbius...

results and conjectures concerning graph coloring are the following: Four-color theorem Strong perfect graph theorem Erdős–Faber–Lovász conjecture Total coloring...

contract to a point. Vertex-transitive graph Generating set of a group Lovász conjecture Cube-connected cycles Algebraic graph theory Cycle graph (algebra)...

solved when n {\displaystyle n} is a prime power Lovász & Young (2002). Richard Karp also conjectured that Ω ( n 2 ) {\displaystyle \Omega (n^{2})} queries...

Daniel Kráľ (Q21062080). In the 1970s, Michael D. Plummer and László Lovász conjectured that every bridgeless cubic graph has an exponential number of perfect...

requires three colors in any proper coloring. This conjecture was proved in several ways. László Lovász proved this in 1978 using topological methods, giving...

Erdős–Faber–Lovász conjecture Erdős–Graham conjecture — see Erdős–Graham problem Erdős–Hajnal conjecture Erdős–Gyárfás conjecture Erdős–Straus conjecture Erdős...

( G ) ≤ χ ( G ) . {\displaystyle \chi _{V}(G)\leq \chi (G).} Lovász number: The Lovász number of a complementary graph is also a lower bound on the chromatic...

Természettudományi Értesítő, 34: 104–119. Lovász, László (1972a), "Normal hypergraphs and the perfect graph conjecture", Discrete Mathematics, 2 (3): 253–267...

problems in mathematics) The Erdős–Straus conjecture is an unproven statement in number theory. The conjecture is that, for every integer n {\displaystyle...

Fisher, and Whyte confirmed the counterexample. Edge-transitive graph Lovász conjecture Semi-symmetric graph Zero-symmetric graph Godsil, Chris; Royle, Gordon...

Therefore, to prove the conjecture, it would suffice to prove that graphs of this type cannot be drawn as thrackles. Lovász, L.; Pach, J.; Szegedy, M...

b-coloring and a graph's smallest cycle to partly prove the Erdős–Faber–Lovász conjecture. V. Campos, C. Lima, A. Silva: "b-coloring graphs with girth at least...

with parts of size 5 {\displaystyle 5} . László Lovász proved a local version of Sidorenko's conjecture, i.e. for graphs that are "close" to random graphs...

awarded to Sanjeev Arora, Uriel Feige, Shafi Goldwasser, Carsten Lund, László Lovász, Rajeev Motwani, Shmuel Safra, Madhu Sudan, and Mario Szegedy for work on...

counterexample to a conjecture of Edmonds and Giles" (PDF), Discrete Mathematics, 32 (2): 213–215, doi:10.1016/0012-365X(80)90057-6, MR 0592858 Lovász, László (1976)...