Topological Bounds for Graph Representations over Any Field
From MaRDI portal
Publication:5150813
DOI10.1137/19M1295921zbMath1458.05175arXiv1909.06823OpenAlexW3118499386MaRDI QIDQ5150813
Meysam Alishahi, Frédéric Meunier
Publication date: 15 February 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.06823
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on eigenvalue bounds for independence numbers of non-regular graphs
- On the chromatic number of general Kneser hypergraphs
- Kneser's conjecture, chromatic number, and homotopy
- Local chromatic number, Ky Fan's theorem, and circular colorings
- Coloring graphs with locally few colors
- A certain combinatorial inequality
- A short proof of Kneser's conjecture
- Constructive bounds for a Ramsey-type problem
- The maximum edge biclique problem is NP-complete
- Topological lower bounds for the chromatic number: a hierarchy
- Colourful theorems and indices of homomorphism complexes
- Topological bounds on the dimension of orthogonal representations of graphs
- Strengthening topological colorful results for graphs
- Orthogonal representations over finite fields and the chromatic number of graphs
- A generalization of Tucker's combinatorial lemma with topological applications
- On the Shannon capacity of a graph
- On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
- A generalization of Gale's lemma
- Graphs and Geometry
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
This page was built for publication: Topological Bounds for Graph Representations over Any Field