László Lovász

From MaRDI portal
(Redirected from Person:952420)
Person:188995

Available identifiers

zbMath Open lovasz.laszloDBLPl/LaszloLovaszFactGridQ885992WikidataQ357918 ScholiaQ357918MaRDI QIDQ6480584

List of research outcomes





PublicationDate of PublicationType
Subgraph densities in Markov spaces2024-01-25Paper
Locally common graphs2023-10-06Paper
Multigraph limits, unbounded kernels, and Banach space decorated graphs2021-12-02Paper
Discrete quantitative nodal theorem2021-09-28Paper
Flows on measurable spaces2021-07-26Paper
Random homomorphisms into the orthogonality graph2021-05-08Paper
Hyperfinite graphings and combinatorial optimization2021-01-25Paper
Compact graphings2020-10-02Paper
Graphs and geometry2019-10-15Paper
Measures on the square as sparse graph limits2019-07-17Paper
Nullspace embeddings for outerplanar graphs2018-02-26Paper
Positive graphs2017-02-13Paper
Lifting Markov chains to speed up mixing2016-09-29Paper
Faster mixing via average conductance2016-09-29Paper
Reflections on Paul Erdős on his birth centenary2016-06-15Paper
Positive graphs2015-12-11Paper
45 Jahre Graphentheorie2015-10-29Paper
Graph theory over 45 years2015-06-26Paper
Graph limits and parameter testing2014-11-25Paper
The automorphism group of a graphon2014-11-07Paper
Limits of locally-globally convergent graph sequences2014-06-06Paper
One mathematics2014-06-03Paper
Non-deterministic graph property testing2014-02-24Paper
Left and right convergence of graphs with bounded degree2013-01-21Paper
Large networks and graph limits2013-01-08Paper
Convergent sequences of dense graphs. II. Multiway cuts and statistical physics2012-08-30Paper
Random graphons and a weak positivstellensatz for graphs2012-06-04Paper
Local versus global properties of metric spaces2012-05-30Paper
Characterizing partition functions of the vertex model2012-05-23Paper
Limits of local-global convergent graph sequences2012-05-19Paper
Computational results of an \(O^{\ast }(n^{4})\) volume algorithm2012-05-14Paper
https://portal.mardi4nfdi.de/entity/Q31060382011-12-19Paper
Limits of randomly grown graph sequences2011-11-29Paper
Dot product representations of planar graphs2011-11-22Paper
Finitely forcible graphons2011-08-10Paper
Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture2011-06-24Paper
Proving integrality gaps without knowing the linear program2011-05-24Paper
Regularity partitions and the topology of graphons2011-02-18Paper
Testing properties of graphs and functions2010-12-06Paper
Limits of compact decorated graphs2010-10-25Paper
The graph theoretic moment problem2010-10-25Paper
Exit frequency matrices for finite Markov chains2010-10-14Paper
Local versus global properties of metric spaces2010-08-16Paper
Hit-and-run from a corner2010-08-15Paper
(Almost) tight bounds and existence theorems for confluent flows2010-08-15Paper
Dual graph homomorphism functions2010-04-27Paper
Semi-matchings for bipartite graphs and load balancing.2010-04-20Paper
Moments of two-variable functions and the uniqueness of graph limits2010-03-19Paper
The history of the LLL-algorithm2010-03-05Paper
Very large graphs2009-11-18Paper
Matching theory2009-09-03Paper
Semidefinite functions on categories2009-07-08Paper
Directions in AG\((2,p^2)\).2009-06-23Paper
Contractors and connectors of graph algebras2009-02-20Paper
(Almost) Tight bounds and existence theorems for single-commodity confluent flows2008-12-21Paper
Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing2008-11-12Paper
Graph parameters and semigroup functions2008-05-13Paper
Generalized quasirandom graphs2007-12-10Paper
Blocking Conductance and Mixing in Random Walks2007-07-30Paper
On multiple blocking sets in Galois planes2007-07-27Paper
https://portal.mardi4nfdi.de/entity/Q52946992007-07-26Paper
Connection matrices2007-06-28Paper
Szemerédi's lemma for the analyst2007-05-14Paper
The geometry of logconcave functions and sampling algorithms2007-05-11Paper
Critical facets of the stable set polytope2007-03-29Paper
Counting graph homomorphisms2007-03-05Paper
Reflection positivity, rank connectivity, and homomorphism of graphs2007-02-01Paper
Limits of dense graph sequences2007-01-16Paper
Waiting for a Bat to Fly By (in Polynomial Time)2006-12-05Paper
Semi-matchings for bipartite graphs and load balancing2006-10-05Paper
Normal hypergraphs and the perfect graph conjecture. (Reprint)2006-08-04Paper
The rank of connection matrices and the dimension of graph algebras2006-06-09Paper
Hit-and-Run from a Corner2006-06-01Paper
A localization inequality for set functions.2006-05-18Paper
Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm2006-04-28Paper
Graph minor theory2006-02-20Paper
Approximate Counting and Quantum Computation2005-11-14Paper
Discrete mathematics. Transl. from the English by Sabine Giese2005-04-14Paper
https://portal.mardi4nfdi.de/entity/Q46575862005-03-14Paper
https://portal.mardi4nfdi.de/entity/Q31605372005-02-09Paper
Approximating min sum set cover2004-11-05Paper
https://portal.mardi4nfdi.de/entity/Q44100182004-02-17Paper
Deterministic and randomized polynomial‐time approximation of radii2003-11-16Paper
Harmonic and analytic functions on graphs2003-08-31Paper
https://portal.mardi4nfdi.de/entity/Q44112802003-07-07Paper
https://portal.mardi4nfdi.de/entity/Q47962812003-03-04Paper
Discrete Mathematics2003-01-27Paper
https://portal.mardi4nfdi.de/entity/Q44074492003-01-01Paper
Steinitz representations of polyhedra and the Colin de Verdière number2002-12-10Paper
Energy of convex sets, shortest paths, and resistance2002-09-25Paper
Determining the Genus of a Map by Local Observation of a Simple Random Process2002-02-13Paper
Facets with fixed defect of the stable set polytope2001-10-30Paper
Unextendible product bases2001-07-29Paper
Integer sequences and semidefinite programming2001-04-01Paper
A correction: Orthogonal representations and connectivity of graphs2000-09-14Paper
The cover time, the blanket time, and the Matthews bound2000-05-11Paper
Hit-and-run mixes fast2000-03-21Paper
Mixing times for uniformly ergodic Markov chains2000-03-01Paper
https://portal.mardi4nfdi.de/entity/Q42501442000-02-09Paper
https://portal.mardi4nfdi.de/entity/Q27376552000-01-01Paper
Reversal of Markov Chains and the Forget Time1999-11-08Paper
https://portal.mardi4nfdi.de/entity/Q42429111999-11-08Paper
https://portal.mardi4nfdi.de/entity/Q42340531999-09-29Paper
On the null space of a Colin de Verdière matrix1999-07-12Paper
https://portal.mardi4nfdi.de/entity/Q42303731999-04-22Paper
The Colin de Verdière number and sphere representations of a graph1999-03-14Paper
https://portal.mardi4nfdi.de/entity/Q42084511999-03-02Paper
A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs1998-03-24Paper
The membership problem in jump systems1998-03-18Paper
On Conway's thrackle conjecture1998-03-11Paper
Interactive proofs and the hardness of approximating cliques1998-01-21Paper
https://portal.mardi4nfdi.de/entity/Q48717791997-04-07Paper
https://portal.mardi4nfdi.de/entity/Q48786671997-01-13Paper
https://portal.mardi4nfdi.de/entity/Q48717891996-05-29Paper
https://portal.mardi4nfdi.de/entity/Q48717761996-04-08Paper
https://portal.mardi4nfdi.de/entity/Q48717881996-04-08Paper
On the invariance of Colin de Verdière's graph parameter under clique sums1996-03-31Paper
https://portal.mardi4nfdi.de/entity/Q48407731996-03-18Paper
https://portal.mardi4nfdi.de/entity/Q48413091995-11-22Paper
The cocycle lattice of binary matroids. II1995-10-09Paper
Exact mixing in an unknown Markov chain1995-09-11Paper
Search Problems in the Decision Tree Model1995-08-06Paper
Isoperimetric problems for convex bodies and a localization lemma1995-07-02Paper
Linear Decision Trees, Subspace Arrangements, and Mobius Functions1995-04-18Paper
Chip-firing games on directed graphs1995-01-31Paper
Chessboard Complexes and Matching Complexes1994-07-03Paper
https://portal.mardi4nfdi.de/entity/Q42846021994-06-06Paper
Random walks in a convex body and an improved volume algorithm1994-06-01Paper
https://portal.mardi4nfdi.de/entity/Q42946161994-05-17Paper
Stable sets and polynomials1994-03-01Paper
https://portal.mardi4nfdi.de/entity/Q42760031994-01-09Paper
Communication complexity and combinatorial lattice theory1993-12-20Paper
A note on the last new vertex visited by a random walk1993-12-10Paper
Geometric algorithms and combinatorial optimization.1993-11-28Paper
The cocycle lattice of binary matroids1993-08-25Paper
Geometric algorithms and combinatorial optimization1993-06-05Paper
A Monte-Carlo Algorithm for Estimating the Permanent1993-05-17Paper
Dating to marriage1993-05-16Paper
The Generalized Basis Reduction Algorithm1993-01-17Paper
On integer points in polyhedra: A lower bound1993-01-16Paper
Cones of Matrices and Set-Functions and 0–1 Optimization1992-09-27Paper
Singular spaces of matrices and their application in combinatorics1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40111081992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40103411992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40111011992-09-27Paper
A matching algorithm for regular bipartite graphs1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39734061992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39774261992-06-25Paper
Graphs with given automorphism group and few edge orbits1992-06-25Paper
Chip-firing games on graphs1991-01-01Paper
Greedoids1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52036811990-01-01Paper
Entropy splitting for antiblocking corners and perfect graphs1990-01-01Paper
On the number of halving planes1990-01-01Paper
The Shapes of Polyhedra1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34956171990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47336651989-01-01Paper
An on-line graph coloring algorithm with sublinear performance ratio1989-01-01Paper
Orthogonal representations and connectivity of graphs1989-01-01Paper
On the graph of large distances1989-01-01Paper
The intersection of matroids and antimatroids1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32113131989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52030551989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34702551989-01-01Paper
Covering minima and lattice-point-free convex bodies1988-01-01Paper
Rubber bands, convex embeddings and graph connectivity1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47324841988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30338451988-01-01Paper
Matching structure and the matching lattice1987-01-01Paper
On some combinatorial properties of algebraic matroids1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37840871987-01-01Paper
Matching theory1986-01-01Paper
The Chromatic Number of Kneser Hypergraphs1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37452761986-01-01Paper
A note on perfect graphs1986-01-01Paper
Relaxations of vertex packing1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37579741986-01-01Paper
Searching in Trees, Series-Parallel and Interval Orders1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37835561986-01-01Paper
Discrepancy of set-systems and matrices1986-01-01Paper
Non-interval greedoids and the transposition property1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37524251986-01-01Paper
Homomorphisms and Ramsey properties of antimatroids1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37468791986-01-01Paper
Lengths of cycles in halin graphs1985-01-01Paper
Homotopy properties of greedoids1985-01-01Paper
Polymatroid greedoids1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37374401985-01-01Paper
A note on selectors and greedoids1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37410781985-01-01Paper
Basis graphs of greedoids and two-connectivity1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32166861984-01-01Paper
Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization1984-01-01Paper
A polynomial-time test for total dual integrality in fixed dimension1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33292251984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33463441984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33382681984-01-01Paper
Greedoids and Linear Objective Functions1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51849341984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36839011984-01-01Paper
Ear-decompositions of matching-covered graphs1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36822361983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33155321983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36694521983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33204351983-01-01Paper
Structural properties of greedoids1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30373151983-01-01Paper
Factoring polynomials with rational coefficients1982-01-01Paper
Borsuk's theorem and the number of facets of centrally symmetric polytopes1982-01-01Paper
On Generic Rigidity in the Plane1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39337391982-01-01Paper
Brick decompositions and the matching rank of graphs1982-01-01Paper
Bounding the Independence Number of a Graph1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47481661982-01-01Paper
Tibor Gallai - seventy years old1982-01-01Paper
Tibor Gallai1982-01-01Paper
Khachiyan’s algorithm for linear programming1981-01-01Paper
The ellipsoid method and its consequences in combinatorial optimization1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39282301981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39344041981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33193311981-01-01Paper
Cycles through specified vertices of a graph1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33282861981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39344651981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36743991981-01-01Paper
Matroid matching and some applications1980-01-01Paper
On a product dimension of graphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38961581980-01-01Paper
A new linear programming algorithm - better or worse than the simplex method?1980-01-01Paper
Matroids and Sperner's lemma1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38630801980-01-01Paper
On the Shannon capacity of a graph1979-01-01Paper
Graph Theory and Integer Programming1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38808491979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39128371979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39128221979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38917671979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38580331979-01-01Paper
Distance matrix polynomials of trees1978-01-01Paper
Kneser's conjecture, chromatic number, and homotopy1978-01-01Paper
A homology theory for spanning tress of a graph1978-01-01Paper
Mengerian theorems for paths of bounded length1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42000871978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41892811978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41632391978-01-01Paper
Distance matrix polynomials of trees1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41651831978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41803911977-01-01Paper
On minimal elementary bipartite graphs1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41339941977-01-01Paper
Some Remarks on Generalized Spectra1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41322591977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41192041977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41001211976-01-01Paper
A forbidden substructure characterization of Gauss codes1976-01-01Paper
On two minimax theorems in graph1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41115901976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38597901976-01-01Paper
On some connectivity properties of Eulerian graphs1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41062321976-01-01Paper
The Number of Values of a Boolean Function1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41233441976-01-01Paper
On the ratio of optimal integral and fractional covers1975-01-01Paper
Three short proofs in graph theory1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40749271975-01-01Paper
Spectra of graphs with transitive groups1975-01-01Paper
2-Matchings and 2-covers of hypergraphs1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41057011975-01-01Paper
On a Family of Planar Bicritical Graphs1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40655871975-01-01Paper
A characterization of cancellable k-ary structures1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40617171974-01-01Paper
Valencies of graphs with 1-factors1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44041741974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40609991974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47709821974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51813941974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40536901974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40834611973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56726611973-01-01Paper
On the sum of matroids1973-01-01Paper
Antifactors of graphs1973-01-01Paper
On the eigenvalues of trees1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44051921973-01-01Paper
Connectivity in digraphs1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40834831973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40445771973-01-01Paper
Normal hypergraphs and the perfect graph conjecture1972-01-01Paper
A characterization of perfect graphs1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56411611972-01-01Paper
On the structure of factorizable graphs. II1972-01-01Paper
The factorization of graphs. II1972-01-01Paper
On the structure of factorizable graphs1972-01-01Paper
A note on the line reconstruction problem1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56706361972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56640571972-01-01Paper
On the cancellation law among finite relational structures1971-01-01Paper
On finite Dirichlet series1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56340421971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41035801971-01-01Paper
Subgraphs with prescribed valencies1970-01-01Paper
A generalization of Kónig's theorem1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56729361970-01-01Paper
A remark on Menger's theorem1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56116421970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55854581969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55396491968-01-01Paper
On chromatic number of finite set-systems1968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55639391968-01-01Paper
Operations with structures1967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55418271967-01-01Paper
Über die starke Multiplikation von geordneten Graphen1967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55304701966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55304721965-01-01Paper

Research outcomes over time

This page was built for person: László Lovász