Graphs and geometry
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)
- Rotations on the triangular grid: angles of changes of the neighborhood motion map
- Approximation of the Shannon capacity via matrix cone programming
- On the subspace choosability in graphs
- Conformal parameterization of disks and sphere sectors
- Richard von Mises’ work for ZAMM until his emigration in 1933 and glimpses of the later history of ZAMM
- Topological bounds for graph representations over any field
- Weak harmonic labeling of graphs and multigraphs
- Orthonormal representations, vector chromatic number, and extension complexity
- Irreducible nonmetrizable path systems in graphs
- Aspect ratio universal rectangular layouts
- A simplified treatment of Ramana's exact dual for semidefinite programming
- Morse theory for discrete magnetic operators and nodal count distribution for graphs
- Graph-theoretic graphics
- scientific article; zbMATH DE number 1943970 (Why is no real title available?)
- Aspect ratio universal rectangular layouts
- Jamming and geometric representations of graphs
- When is a planar rod configuration infinitesimally rigid?
- Shannon capacity and the categorical product
- Positive matching decompositions of graphs
- Ramsey numbers of sparse digraphs
- Approximating the orthogonality dimension of graphs and hypergraphs
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank
- Hypergraph LSS-ideals and coordinate sections of symmetric tensors
- Three conjectures of Ostrander on digraph Laplacian eigenvectors
- Geodesic geometry on graphs
- Stability of \(\mathbb{Z}^2\) configurations in 3D
- Representing graphs and maps
- Exploring the rigidity of planar configurations of points and rods
- Super stable tensegrities and the Colin de Verdière number \(\nu\)
- Computing paths of large rank in planar frameworks deterministically
- The inertia bound is far from tight
- On Euclidean distances and sphere representations
- scientific article; zbMATH DE number 3980440 (Why is no real title available?)
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)
