Graphs and geometry
DOI10.1090/COLL/065zbMATH Open1425.05001OpenAlexW3016023902MaRDI QIDQ5236381FDOQ5236381
Authors: László Lovász 
Publication date: 15 October 2019
Published in: Colloquium Publications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/coll/065
Recommendations
tilingsdiscrete analytic functionsorthogonal representationscoin representationcombinatorics of subspacesgeneric frameworks
Applications of graph theory (05C90) Semidefinite programming (90C22) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Combinatorial aspects of block designs (05B05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Theta functions and abelian varieties (14K25) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General mathematical topics and methods in quantum theory (81Q99) Other problems of combinatorial convexity (52A37) Special matrices (15B99)
Cited In (33)
- Topological Bounds for Graph Representations over Any Field
- Positive matching decompositions of graphs
- Approximation of the Shannon capacity via matrix cone programming
- Stability of Z2 configurations in 3D
- Rotations on the triangular grid: angles of changes of the neighborhood motion map
- Weak harmonic labeling of graphs and multigraphs
- On Euclidean distances and sphere representations
- Hypergraph LSS-ideals and coordinate sections of symmetric tensors
- On the subspace choosability in graphs
- Conformal parameterization of disks and sphere sectors
- Graph-theoretic graphics
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank
- Aspect ratio universal rectangular layouts
- Shannon capacity and the categorical product
- Geodesic geometry on graphs
- Ramsey numbers of sparse digraphs
- The inertia bound is far from tight
- Aspect ratio universal rectangular layouts
- Title not available (Why is that?)
- Morse theory for discrete magnetic operators and nodal count distribution for graphs
- Jamming and geometric representations of graphs
- Orthonormal representations, vector chromatic number, and extension complexity
- Three conjectures of Ostrander on digraph Laplacian eigenvectors
- Irreducible nonmetrizable path systems in graphs
- When is a planar rod configuration infinitesimally rigid?
- A simplified treatment of Ramana's exact dual for semidefinite programming
- Super stable tensegrities and the Colin de Verdière number \(\nu\)
- Computing paths of large rank in planar frameworks deterministically
- Representing graphs and maps
- Richard von Mises’ work for ZAMM until his emigration in 1933 and glimpses of the later history of ZAMM
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exploring the rigidity of planar configurations of points and rods
This page was built for publication: Graphs and geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236381)
