Generalized Borsuk graphs

DOI10.1007/S00454-024-00695-1MaRDI QIDQ6642292

Francisco Martinez-Figueroa

Publication date: 22 November 2024

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

random graphsgeometric graphstopological combinatoricsBorsuk-Ulam\(G\)-actions

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Discrete geometry (52C99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the chromatic numbers of spheres in \(\mathbb R^n\)
• Kneser's conjecture, chromatic number, and homotopy
• The neighborhood complex of a random graph
• A short proof of Kneser's conjecture
• New construction of graphs with high chromatic number and small clique number
• Improved Frankl-Rödl theorem and some of its geometric consequences
• Complexes of graph homomorphisms
• Random Geometric Graphs
• Topological obstructions to graph colorings
• The chromatic number of random Borsuk graphs
• 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
• Combinatorial algebraic topology

This page was built for publication: Generalized Borsuk graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6642292)