Related papers: How many cages midscribe an egg?
A graph $G$ is said to be perfectly divisible if for every induced subgraph $H$ of $G$ with at least one edge, the vertex set $V(H)$ can be partitioned into two sets $A, B$ such that $H[A]$ is perfect and $\omega(B) < \omega(H)$. It is easy…
Gr\"unbaum's inequality guarantees that the centroid of a convex body has halfspace depth at least $1/e$: every halfspace containing the centroid captures at least a $1/e$ fraction of the body's volume. For mixed-integer convex sets…
Let $F$ be a family of pseudo-disks in the plane, and $P$ be a finite subset of $F$. Consider the hypergraph $H(P,F)$ whose vertices are the pseudo-disks in $P$ and the edges are all subsets of $P$ of the form $\{D \in P \mid D \cap S \neq…
Answering a question posed by Joseph Malkevitch, we prove that there exists a polyhedral graph, with triangular faces, such that every realization of it as the graph of a convex polyhedron includes at least one face that is a scalene…
This paper is concerned with "nice" compactifications of manifolds. Siebenmann's iconic dissertation characterized open manifolds M^m (m>5) compactifiable by addition of a manifold boundary. His theorem extends easily to cases where M^m is…
A problem of Erd\H{o}s asks for extremal conditions forcing edge-disjoint cycles with a prescribed nested structure. In the geometric version, the nesting is required to be noncrossing with respect to the cyclic orders. Fern\'andez, Kim,…
A closed quasigeodesic is a closed curve on the surface of a polyhedron with at most $180^\circ$ of surface on both sides at all points; such curves can be locally unfolded straight. In 1949, Pogorelov proved that every convex polyhedron…
A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…
In 1951, Bang posed the affine plank conjecture, which remains open: If a convex body in $\mathbb{R}^d$ is covered by planks, then the total relative width of the planks is at least one. We prove a lower bound of $2/(1+\sqrt{d})$ for this…
We prove a transversality "lifting property" for compactified configuration spaces as an application of the multijet transversality theorem: the submanifold of configurations of points on an arbitrary submanifold of Euclidean space may be…
The longstanding Godbersen's conjecture states that for any convex body $K \subset \mathbb R^n$ of volume $1$ and any $j \in \{0, \ldots, n\}$, the mixed volume $V_j = V(K[j], -K[n - j])$ is bounded by $\binom{n}{j}$, with equality if and…
A $\textit{regular polygon surface}$ $M$ is a surface graph $(\Sigma, \Gamma)$ together with a continuous map $\psi$ from $\Sigma$ into Euclidean 3-space which maps faces to regular Euclidean polygons. When $\Sigma$ is homeomorphic to the…
We prove a theorem on equivariant maps implying the following two corollaries: (1) Let N and M be compact orientable n-manifolds with boundaries such that M\subset N, the inclusion M\to N induces an isomorphism in integral cohomology, both…
Meeks, P\'erez and Ros conjectured that a closed Riemannian $3$-manifold which does not admit any closed embedded minimal surface whose two-sided covering is stable, must be diffeomorphic to a quotient of the $3$-sphere. We give an…
Suppose $M$ is a complete, embedded minimal surface in $\mathbb{R}^3$ with an infinite number of ends, finite genus and compact boundary. We prove that the simple limit ends of $M$ have properly embedded representatives with compact…
The "square peg problem" or "inscribed square problem" of Toeplitz asks if every simple closed curve in the plane inscribes a (non-degenerate) square, in the sense that all four vertices of that square lie on the curve. By a variety of…
A matchstick graph is a plane graph with edges drawn as unit-distance line segments. Harborth introduced these graphs in 1981 and conjectured that the maximum number of edges for a matchstick graph on $n$ vertices is $\lfloor…
This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restrictions: the cap's faces are quadrilaterals, with vertices…
Let $X$ be a real normed space with unit sphere S. We prove that $X$ is an inner product space if and only if there exists a real number $\rho=\sqrt{(1+\cos\frac{2k\pi}{2m+1})/2}$, $(k=1,2,\ldots , m ;\:m=1,2,\ldots)$, such that every chord…
Following on the King Chicken Theorems originally proved by Maurer, we examine the idea of multiple flocks of chickens by bringing the chickens from tournaments to multipartite tournaments. As Kings have already been studied in multipartite…