Graph theory -- a survey on the occasion of the Abel Prize for László Lovász

DOI10.1365/s13291-022-00247-7zbMath1492.01017OpenAlexW4220848082MaRDI QIDQ2143333

Johannes Carmesin

Publication date: 31 May 2022

Published in: Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1365/s13291-022-00247-7

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matroid intersection, base packing and base covering for infinite matroids
• The clique density theorem
• Colouring perfect graphs with bounded clique number
• Extremal results for random discrete structures
• Combinatorial theorems in sparse random sets
• Axioms for infinite matroids
• Sparsity. Graphs, structures, and algorithms
• Graph minors. XX: Wagner's conjecture
• A new upper bound for diagonal Ramsey numbers
• Kneser's conjecture, chromatic number, and homotopy
• The strong perfect graph theorem
• Ryser's conjecture for tripartite 3-graphs
• The convergence of circle packings to the Riemann mapping
• The early evolution of the \(H\)-free process
• Menger's theorem for infinite graphs
• The spherical genus and virtually planar graphs
• A note on Ramsey numbers
• Ramsey's theorem - a new lower bound
• Endomorphisms of symbolic algebraic varieties
• Highly connected sets and the excluded grid theorem
• Geometric algorithms and combinatorial optimization.
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Every planar graph is 5-choosable
• Generalized Kneser coloring theorems with combinatorial proofs
• Finitely forcible graph limits are universal
• Integer homology 3-spheres admit irreducible representations in \(\mathrm{SL}(2,{\mathbb C})\)
• Hyperbolic and parabolic packings
• Thin position and the recognition problem for \(S^ 3\)
• On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
• On the convergence of circle packings to the Riemann map
• On minor-closed classes of matroids with exponential growth rate
• Tangle-tree duality in abstract separation systems
• Towards tight(er) bounds for the excluded grid theorem
• Proof of Nash-Williams' intersection conjecture for countable matroids
• Measuring edge importance: a quantitative analysis of the stochastic shielding approximation for random processes on graphs
• Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded
• Measures on the square as sparse graph limits
• On the decomposition threshold of a given graph
• A correlation inequality for bipartite graphs
• Abstract separation systems
• Limits of locally-globally convergent graph sequences
• Proof of the Lovász conjecture
• Processes on unimodular random networks
• Graphs and obstructions in four dimensions.
• Recognizing Berge graphs
• On torsion-free groups with infinitely many ends
• Rank-width and vertex-minors
• Die Widerspruchsfreiheit der allgemeinen Mengenlehre
• Über eine Eigenschaft der ebenen Komplexe
• Neuaufbau der Endentheorie
• Solving Rota's Conjecture
• Hadwiger’s Conjecture
• Graph Theory
• The Erdös-Hajnal Conjecture-A Survey
• Polynomial Bounds for the Grid-Minor Theorem
• Edge-Disjoint Spanning Trees of Finite Graphs
• Elusive extremal graphs
• The intersection of a matroid and a simplicial complex
• A constructive proof of the general lovász local lemma
• Circle graph obstructions under pivoting
• Efficient Planarity Testing
• On the Shannon capacity of a graph
• A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
• Non-Separable and Planar Graphs
• Mathematics and Computation
• A survey of χ‐boundedness
• Embeddability in R ³ is NP-hard
• The Directed Flat Wall Theorem
• A constructive proof of the Lovász local lemma
• The densest matroids in minor-closed classes with exponential growth rate
• Flag algebras
• Problems around 3-manifolds
• Universal graphs and universal functions
• Asymmetric graphs
• Decomposition of Finite Graphs Into Forests
• Halfway to Rota’s Basis Conjecture
• Combinatorial algebraic topology