The following pages link to László Lovász (Q6480584):
Displaying 1 item.
- (Q188995) (redirect page) (← links)
- Characterizing partition functions of the vertex model (Q420721) (← links)
- Computational results of an \(O^{\ast }(n^{4})\) volume algorithm (Q421722) (← links)
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics (Q447926) (← links)
- The automorphism group of a graphon (Q468695) (← links)
- Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture (Q547787) (← links)
- On some combinatorial properties of algebraic matroids (Q581407) (← links)
- Structural properties of greedoids (Q594882) (← links)
- Testing properties of graphs and functions (Q607829) (← links)
- Dot product representations of planar graphs (Q648410) (← links)
- Limits of randomly grown graph sequences (Q648961) (← links)
- Chip-firing games on directed graphs (Q685991) (← links)
- Kneser's conjecture, chromatic number, and homotopy (Q755592) (← links)
- Corrigendum to our paper ''The ellipsoid method and its consequences in combinatorial optimization'' (Q761351) (← links)
- Chip-firing games on graphs (Q805639) (← links)
- Greedoids (Q810029) (← links)
- Entropy splitting for antiblocking corners and perfect graphs (Q810528) (← links)
- Discrete quantitative nodal theorem (Q820852) (← links)
- Limits of dense graph sequences (Q859618) (← links)
- Critical facets of the stable set polytope (Q873649) (← links)
- Szemerédi's lemma for the analyst (Q879618) (← links)
- On the graph of large distances (Q908937) (← links)
- (Q952420) (redirect page) (← links)
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing (Q952421) (← links)
- Dual graph homomorphism functions (Q966064) (← links)
- Directions in AG\((2,p^2)\). (Q1022873) (← links)
- Semidefinite functions on categories (Q1028868) (← links)
- Ear-decompositions of matching-covered graphs (Q1052341) (← links)
- Brick decompositions and the matching rank of graphs (Q1055426) (← links)
- (Q1061743) (redirect page) (← links)
- A note on selectors and greedoids (Q1061744) (← links)
- Relaxations of vertex packing (Q1078206) (← links)
- Non-interval greedoids and the transposition property (Q1079572) (← links)
- A note on perfect graphs (Q1084108) (← links)
- Discrepancy of set-systems and matrices (Q1084393) (← links)
- Matching theory (Q1088987) (← links)
- Homotopy properties of greedoids (Q1101115) (← links)
- Homomorphisms and Ramsey properties of antimatroids (Q1104331) (← links)
- Matching structure and the matching lattice (Q1112071) (← links)
- Covering minima and lattice-point-free convex bodies (Q1112339) (← links)
- Rubber bands, convex embeddings and graph connectivity (Q1121282) (← links)
- An on-line graph coloring algorithm with sublinear performance ratio (Q1124602) (← links)
- On a product dimension of graphs (Q1142231) (← links)
- Matroids and Sperner's lemma (Q1144026) (← links)
- Matroid matching and some applications (Q1144584) (← links)
- A new linear programming algorithm - better or worse than the simplex method? (Q1153837) (← links)
- Factoring polynomials with rational coefficients (Q1165896) (← links)
- Cycles through specified vertices of a graph (Q1167744) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- Graphs with given automorphism group and few edge orbits (Q1176027) (← links)
- A matching algorithm for regular bipartite graphs (Q1186308) (← links)
- On integer points in polyhedra: A lower bound (Q1196682) (← links)
- Dating to marriage (Q1208489) (← links)
- Geometric algorithms and combinatorial optimization (Q1210712) (← links)
- A characterization of cancellable k-ary structures (Q1217821) (← links)
- Three short proofs in graph theory (Q1223319) (← links)
- On the ratio of optimal integral and fractional covers (Q1224109) (← links)
- On two minimax theorems in graph (Q1229885) (← links)
- On minimal elementary bipartite graphs (Q1245978) (← links)
- Distance matrix polynomials of trees (Q1247981) (← links)
- Mengerian theorems for paths of bounded length (Q1252354) (← links)
- Spectra of graphs with transitive groups (Q1252870) (← links)
- The cocycle lattice of binary matroids (Q1260774) (← links)
- The Colin de Verdière number and sphere representations of a graph (Q1280274) (← links)
- On the null space of a Colin de Verdière matrix (Q1296155) (← links)
- Geometric algorithms and combinatorial optimization. (Q1309040) (← links)
- Communication complexity and combinatorial lattice theory (Q1309387) (← links)
- Stable sets and polynomials (Q1313833) (← links)
- The membership problem in jump systems (Q1369649) (← links)
- On Conway's thrackle conjecture (Q1380797) (← links)
- Antifactors of graphs (Q1393414) (← links)
- Harmonic and analytic functions on graphs (Q1402875) (← links)
- A correction: Orthogonal representations and connectivity of graphs (Q1579514) (← links)
- Facets with fixed defect of the stable set polytope (Q1591354) (← links)
- Discrete mathematics. Transl. from the English by Sabine Giese (Q1770216) (← links)
- Orthogonal representations and connectivity of graphs (Q1823259) (← links)
- Tibor Gallai - seventy years old (Q1837176) (← links)
- Tibor Gallai (Q1838469) (← links)
- Valencies of graphs with 1-factors (Q1845898) (← links)
- Steinitz representations of polyhedra and the Colin de Verdière number (Q1850544) (← links)
- Approximating min sum set cover (Q1884768) (← links)
- Isoperimetric problems for convex bodies and a localization lemma (Q1892428) (← links)
- Exact mixing in an unknown Markov chain (Q1897681) (← links)
- On the invariance of Colin de Verdière's graph parameter under clique sums (Q1899429) (← links)
- The cocycle lattice of binary matroids. II (Q1899432) (← links)
- Mixing times for uniformly ergodic Markov chains (Q1965874) (← links)
- Hit-and-run mixes fast (Q1968791) (← links)
- Compact graphings (Q2003771) (← links)
- Flows on measurable spaces (Q2041865) (← links)
- Multigraph limits, unbounded kernels, and Banach space decorated graphs (Q2056409) (← links)
- Hyperfinite graphings and combinatorial optimization (Q2220974) (← links)
- Polymatroid greedoids (Q2266020) (← links)
- Finitely forcible graphons (Q2275893) (← links)
- The intersection of matroids and antimatroids (Q2277465) (← links)
- Measures on the square as sparse graph limits (Q2312613) (← links)
- Moments of two-variable functions and the uniqueness of graph limits (Q2379365) (← links)
- Graph parameters and semigroup functions (Q2427546) (← links)
- One mathematics (Q2451183) (← links)
- Limits of locally-globally convergent graph sequences (Q2453451) (← links)
- Generalized quasirandom graphs (Q2464159) (← links)
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm (Q2490265) (← links)
- A localization inequality for set functions. (Q2490870) (← links)
- The rank of connection matrices and the dimension of graph algebras (Q2493113) (← links)
- Normal hypergraphs and the perfect graph conjecture. (Reprint) (Q2497986) (← links)
- On the cancellation law among finite relational structures (Q2547900) (← links)
- A characterization of perfect graphs (Q2553372) (← links)
- Normal hypergraphs and the perfect graph conjecture (Q2553445) (← links)
- A note on the line reconstruction problem (Q2554706) (← links)
- On the eigenvalues of trees (Q2555861) (← links)
- Connectivity in digraphs (Q2561604) (← links)
- On the number of halving planes (Q2639341) (← links)
- (Q2707265) (← links)
- (Q2737655) (← links)
- Reflections on Paul Erdős on His Birth Centenary (Q2813089) (← links)
- Lifting Markov chains to speed up mixing (Q2819554) (← links)
- Faster mixing via average conductance (Q2819555) (← links)
- Local Versus Global Properties of Metric Spaces (Q2884582) (← links)
- Random graphons and a weak Positivstellensatz for graphs (Q2888890) (← links)
- Graph limits and parameter testing (Q2931391) (← links)
- (Q3002764) (← links)
- (Q3033845) (← links)
- (Q3037315) (← links)
- Regularity partitions and the topology of graphons (Q3078210) (← links)
- (Q3106038) (← links)
- (Q3160537) (← links)
- The Shapes of Polyhedra (Q3196930) (← links)
- (Q3211313) (← links)
- (Q3216686) (← links)
- A polynomial-time test for total dual integrality in fixed dimension (Q3221757) (← links)
- (Q3315532) (← links)
- (Q3319331) (← links)
- (Q3320435) (← links)
- Greedoids and Linear Objective Functions (Q3323971) (← links)
- (Q3328286) (← links)
- (Q3329225) (← links)
- (Q3338268) (← links)
- (Q3346344) (← links)
- Graph minor theory (Q3372389) (← links)
- (Q3395507) (← links)
- Waiting for a Bat to Fly By (in Polynomial Time) (Q3412101) (← links)
- Reflection positivity, rank connectivity, and homomorphism of graphs (Q3420214) (← links)
- (Q3424888) (← links)
- The geometry of logconcave functions and sampling algorithms (Q3437021) (← links)
- (Q3447287) (← links)
- (Q3470255) (← links)
- (Q3495617) (← links)
- (Almost) Tight bounds and existence theorems for single-commodity confluent flows (Q3546347) (← links)
- Hit-and-run from a corner (Q3580977) (← links)
- (Almost) tight bounds and existence theorems for confluent flows (Q3581008) (← links)
- Local versus global properties of metric spaces (Q3581570) (← links)
- Contractors and connectors of graph algebras (Q3605157) (← links)
- Very large graphs (Q3645674) (← links)
- Borsuk's theorem and the number of facets of centrally symmetric polytopes (Q3660441) (← links)
- (Q3669452) (← links)
- (Q3674399) (← links)
- (Q3682236) (← links)
- (Q3683901) (← links)
- Lengths of cycles in halin graphs (Q3714109) (← links)
- Basis graphs of greedoids and two-connectivity (Q3716815) (← links)
- (Q3737440) (← links)
- (Q3741078) (← links)
- The Chromatic Number of Kneser Hypergraphs (Q3743337) (← links)
- (Q3745276) (← links)
- (Q3746879) (← links)
- (Q3752425) (← links)
- Searching in Trees, Series-Parallel and Interval Orders (Q3756532) (← links)
- (Q3757974) (← links)
- (Q3783556) (← links)
- (Q3784087) (← links)
- Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers (Q3800157) (← links)
- (Q3858033) (← links)
- (Q3859790) (← links)
- (Q3863080) (← links)
- (Q3880849) (← links)
- (Q3891767) (← links)
- (Q3896158) (← links)
- (Q3912822) (← links)
- (Q3912837) (← links)
- Khachiyan’s algorithm for linear programming (Q3914757) (← links)
- (Q3928230) (← links)
- (Q3933739) (← links)
- (Q3934404) (← links)
- (Q3934465) (← links)
- On Generic Rigidity in the Plane (Q3960720) (← links)
- Bounding the Independence Number of a Graph (Q3967569) (← links)
- (Q3973406) (← links)
- (Q3977426) (← links)
- Singular spaces of matrices and their application in combinatorics (Q4005434) (← links)
- (Q4010341) (← links)
- (Q4011101) (← links)
- (Q4011108) (← links)
- Cones of Matrices and Set-Functions and 0–1 Optimization (Q4012419) (← links)
- The Generalized Basis Reduction Algorithm (Q4022031) (← links)
- A Monte-Carlo Algorithm for Estimating the Permanent (Q4032938) (← links)
- (Q4044577) (← links)
- On a Family of Planar Bicritical Graphs (Q4053689) (← links)
- (Q4053690) (← links)
- (Q4060999) (← links)
- (Q4061717) (← links)
- (Q4065587) (← links)
- (Q4074927) (← links)
- (Q4083461) (← links)
- (Q4083483) (← links)
- A forbidden substructure characterization of Gauss codes (Q4093464) (← links)
- The Number of Values of a Boolean Function (Q4099633) (← links)
- (Q4100121) (← links)
- On some connectivity properties of Eulerian graphs (Q4103563) (← links)
- (Q4103580) (← links)
- (Q4105701) (← links)
- (Q4106232) (← links)
- 2-Matchings and 2-covers of hypergraphs (Q4106238) (← links)
- (Q4111590) (← links)
- (Q4119204) (← links)
- (Q4123344) (← links)
- (Q4132259) (← links)
- (Q4133994) (← links)
- (Q4163239) (← links)
- (Q4165183) (← links)
- On the Shannon capacity of a graph (Q4178914) (← links)
- (Q4180391) (← links)
- Some Remarks on Generalized Spectra (Q4182723) (← links)
- Distance matrix polynomials of trees (Q4182793) (← links)
- A homology theory for spanning tress of a graph (Q4187847) (← links)
- (Q4189281) (← links)
- Graph Theory and Integer Programming (Q4193501) (← links)
- (Q4200087) (← links)
- (Q4208451) (← links)
- Reversal of Markov Chains and the Forget Time (Q4212880) (← links)
- (Q4230373) (← links)
- (Q4234053) (← links)
- (Q4242911) (← links)
- (Q4250144) (← links)
- A note on the last new vertex visited by a random walk (Q4271615) (← links)
- (Q4276003) (← links)
- (Q4284602) (← links)
- Random walks in a convex body and an improved volume algorithm (Q4284999) (← links)
- Chessboard Complexes and Matching Complexes (Q4286359) (← links)
- (Q4294616) (← links)
- Linear Decision Trees, Subspace Arrangements, and Mobius Functions (Q4305906) (← links)
- Random walks and anO*(n5) volume algorithm for convex bodies (Q4350884) (← links)
- Interactive proofs and the hardness of approximating cliques (Q4371671) (← links)
- A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs (Q4383122) (← links)
- (Q4404174) (← links)
- (Q4405192) (← links)
- (Q4407449) (← links)
- (Q4410018) (← links)
- (Q4411280) (← links)
- Deterministic and randomized polynomial‐time approximation of radii (Q4435530) (← links)
- Nullspace Embeddings for Outerplanar Graphs (Q4604390) (← links)
- (Q4657586) (← links)
- (Q4732484) (← links)
- (Q4733665) (← links)
- (Q4748166) (← links)
- Search Problems in the Decision Tree Model (Q4764348) (← links)
- On the sum of matroids (Q4767329) (← links)
- (Q4770982) (← links)
- Discrete Mathematics (Q4789147) (← links)
- (Q4796281) (← links)
- (Q4840773) (← links)
- (Q4841309) (← links)
- (Q4871776) (← links)
- (Q4871779) (← links)
- (Q4871788) (← links)
- (Q4871789) (← links)
- (Q4878667) (← links)
- The rank and size of graphs (Q4894621) (← links)
- (Q4899293) (← links)
- Left and right convergence of graphs with bounded degree (Q4903275) (← links)
- Exit Frequency Matrices for Finite Markov Chains (Q4933599) (← links)
- (Q5181394) (← links)
- (Q5184934) (← links)
- The History of the LLL-Algorithm (Q5188537) (← links)
- (Q5203055) (← links)
- (Q5203681) (← links)
- Graphs and Geometry (Q5236381) (← links)
- Graph Theory Over 45 Years (Q5259197) (← links)
- (Q5294699) (← links)
- On multiple blocking sets in Galois planes (Q5295329) (← links)
- Blocking Conductance and Mixing in Random Walks (Q5295401) (← links)
- Non-Deterministic Graph Property Testing (Q5397730) (← links)
- Hit-and-Run from a Corner (Q5470722) (← links)
- Semi-matchings for bipartite graphs and load balancing (Q5491460) (← links)
- (Q5530470) (← links)
- (Q5530472) (← links)
- Über die starke Multiplikation von geordneten Graphen (Q5531679) (← links)
- (Q5539649) (← links)
- On chromatic number of finite set-systems (Q5540284) (← links)
- (Q5541827) (← links)
- Operations with structures (Q5561941) (← links)
- (Q5563939) (← links)
- (Q5585458) (← links)
- Subgraphs with prescribed valencies (Q5595084) (← links)
- A generalization of Kónig's theorem (Q5611639) (← links)
- A remark on Menger's theorem (Q5611641) (← links)
- (Q5611642) (← links)
- On finite Dirichlet series (Q5629733) (← links)
- (Q5634042) (← links)
- (Q5641161) (← links)
- The factorization of graphs. II (Q5659592) (← links)
- On the structure of factorizable graphs (Q5659593) (← links)
- (Q5664057) (← links)
- (Q5670636) (← links)
- (Q5672661) (← links)
- (Q5672936) (← links)
- On the structure of factorizable graphs. II (Q5685115) (← links)
- Approximate Counting and Quantum Computation (Q5704387) (← links)
- Positive graphs (Q5892301) (← links)
- 45 Jahre Graphentheorie (Q5895228) (← links)
- Positive graphs (Q5899554) (← links)
- Algorithms and Data Structures (Q5900762) (← links)
- Energy of convex sets, shortest paths, and resistance (Q5937247) (← links)
- Unextendible product bases (Q5940308) (← links)
- Locally common graphs (Q6046683) (← links)
- Subgraph densities in Markov spaces (Q6184559) (← links)
- Random homomorphisms into the orthogonality graph (Q6367155) (← links)
