Convex Hull of Face Vectors of Colored Complexes
classification
🧮 math.CO
keywords
complexesconvexfacehullvectorscolorablecoloredcomput
read the original abstract
In this paper we verify a conjecture by Kozlov (Discrete Comput Geom 18 (1997) 421--431), which describes the convex hull of the set of face vectors of $r$-colorable complexes on $n$ vertices. As part of the proof we derive a generalization of Tur\'{a}n's graph theorem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.