Transversals and colorings of simplicial spheres
DOI10.1007/s00454-023-00520-1arXiv2111.06560OpenAlexW3211691555MaRDI QIDQ6151037
Seunghun Lee, Joseph Briggs, Michael Gene Dobbins
Publication date: 9 February 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.06560
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Helly-type theorems and geometric transversal theory (52A35)
Cites Work
- Points surrounding the origin
- The number of faces of a simplicial convex polytope
- The classification of simplicial 3-spheres with nine vertices into polytopes and nonpolytopes
- Extremal problems for geometric hypergraphs
- Coloring face-hypergraphs of graphs on surfaces
- Neighborly 4-polytopes with 9 vertices
- Coloring \(d\)-embeddable \(k\)-uniform hypergraphs
- Realization spaces of polytopes
- Enumerating Neighborly Polytopes and Oriented Matroids
- The Upper Bound Conjecture and Cohen-Macaulay Rings
- Every planar map is four colorable
- On the independence ratio of a graph
- Lectures on Polytopes
- Oriented Matroids
- 2-Isomorphic Graphs
- The maximum numbers of faces of a convex polytope
- Many neighborly spheres
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Transversals and colorings of simplicial spheres