ProbXiv
Explorersign in
Problem archiveProblem record

Statement

What is the maximum number of vertices that the convex hull of a subset of k-barycenters of a set of n points in Rd can have? Problem 18 (Karim Adiprasito). For what maximal \varepsilond is there an infinite number of d-polytopes with all dihedral angles \leq \pi − \varepsilond ? Problem 19 (Bartosz Walczak). Does there exist a constant c > 0 such that every intersection graph of n axis-parallel boxes in R3 with clique number 2 (i.e., no three meeting at a common point) has an independent set of size at least cn? For rectangles in R2 , a stronger statement holds—every triangle-free intersec- tion graph of axis-parallel rectangles has chromatic number at most 6 [1]. Such a stronger statement fails in R3 —Burling constructed triangle-free intersection graphs of axis-parallel boxes with arbitrarily large chromatic number [2]. Fur- thermore, the answer to the weighted analogue of the problem above is negative, because the graphs constructed by Burling are known to have arbitrarily large fractional chromatic number [3]. [1] E. Asplund, B. Grünbaum. On a coloring problem, Math. Scand. 8, 181–188, 1960 [2] J. P. Burling. On coloring problems of families of polytopes. PhD thesis, University of Col- orado, Boulder, 1965 [3] B. Walczak. Triangle-free geometric intersection graphs with no large independent sets, Dis- crete Comput. Geom. 53

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.