Graph Theory
Explore fundamental concepts of Graph Theory, from social distancing applications to advanced theorems, enhancing problem-solving skills and mathematical understanding.
Introducing Graph Theory
Explore fundamental concepts in graph theory, from cycle and planar graphs to Eulerian and Hamiltonian graphs, enhancing your understanding of this mathematical field.
A Characterization of Graph Properties Testable for General Planar Graphs with One-Sided Error
Explore graph properties testable for general planar graphs with one-sided error, focusing on characterization and analysis techniques.
Parametric Shortest Paths in Planar Graphs
Explore efficient algorithms for computing shortest paths in planar graphs with varying edge weights, enhancing understanding of graph theory and optimization techniques.
More on Graphs and Euler's Formula in Algebraic Topology - Lecture 10
Explores applications of Euler's formula in planar graphs, including complete and bipartite graphs, Five neighbours theorem, Six colouring theorem, and Pick's formula for computing areas of integral polygonal figures.
Planar Site Percolation via Tree Embeddings
Explore planar site percolation and tree embeddings in infinite graphs. Discover novel proofs for Bernoulli percolation and confirm a 1996 conjecture by Benjamini and Schramm.
On (1 + ε)-Approximate (Vertex) Cut Sparsifiers
Explore advanced graph compression techniques for planar and quasi-bipartite graphs, focusing on high-quality cut sparsifiers and their size bounds. Analyze contraction-based approaches and their limitations.
Planar Partition Oracles for Bounded Degree Graphs in Polynomial Time
Explore planar graph partition oracles for bounded degree graphs, focusing on hyperfinite decompositions and their applications in sublinear algorithms and property testing.
On Pfaffians in Spin Models
Explore Pfaffian relations in spin models, focusing on Ising models on planar graphs and their correlation functions. Discover insights into ferromagnetic spin models and graph simplifications.
A Polynomial Time Approximation Scheme for Facility Location on Planar Graphs
Explore efficient algorithms for facility location on planar graphs, focusing on polynomial time approximation schemes and their applications in network optimization.
Origami Software from Scratch
Explore the journey of creating origami software, from basic geometry to complex algorithms, with interactive visualizations and insights into mathematical foundations and user-friendly design.
Planar Graphs Have Bounded Queue-Number
Explore the theory of planar graphs and their bounded queue-number property, including history, extensions, and applications in graph theory.
Miracles of Algebraic Graph Theory
Explore algebraic graph theory's fascinating applications in spectral analysis, graph drawing, and network approximation. Discover how mathematical concepts revolutionize our understanding of complex structures.
TONCAS - Introduction to Graph Theory and Mathematical Conditions
Discover the powerful TONCAS mathematical acronym and its applications in graph theory, exploring bipartite graphs, planar embeddings, and degree sequences through clear mathematical reasoning.
Maximal Mumford Curves and Graph Embeddings in Real Algebraic Geometry
Explore the geometric properties of MM-curves, focusing on real stable curves, hyperplane arrangements, and graph embeddings in relation to Mumford curves and their deformations.
Geometry of Dimer Models - ICBS 2024
Explore asymptotic phenomena in random dimer coverings, focusing on Aztec diamonds and their connection to Riemann surface geometry.
Geometry of Dimer Models - ICBS 2024
Explore asymptotic phenomena in random dimer coverings, focusing on Aztec diamonds and their connection to Riemann surface geometry.