Related papers: The Stamp Folding Problem From a Mountain-Valley P…
It was recently proved that every claw-free cubic graph admits a (1, 1, 2, 2)-packing coloring--that is, its vertex set can be partitioned into two 1-packings and two 2-packings. This result was established by Bre\v{s}ar, Kuenzel, and Rall…
The Berge-Fulkerson conjecture states that every bridgeless cubic graph can be covered with six perfect matchings such that each edge is covered exactly twice. An equivalent reformulation is that it's possible to find a 6-cycle 4-cover. In…
Let I be an independent set of a graph G. Imagine that a token is located on any vertex of I. We can now move the tokens of I along the edges of the graph as long as the set of tokens still defines an independent set of G. Given two…
Using existing classification results for the 7- and 8-cycles in the pancake graph, we determine the number of permutations that require 4 pancake flips (prefix reversals) to be sorted. A similar characterization of the 8-cycles in the…
We propose a novel graph clustering method guided by additional information on the underlying structure of the clusters (or communities). The problem is formulated as the matching of a graph to a template with smaller dimension, hence…
We consider the problem of covering an input graph $H$ with graphs from a fixed covering class $G$. The classical covering number of $H$ with respect to $G$ is the minimum number of graphs from $G$ needed to cover the edges of $H$ without…
Graph clustering is a fundamental problem that has been extensively studied both in theory and practice. The problem has been defined in several ways in literature and most of them have been proven to be NP-Hard. Due to their high practical…
We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem---to extend a straight-line planar drawing of a subgraph to a planar drawing of the whole graph---and…
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
Using a calculus of variations approach, we determine the shape of a typical plane partition in a large box (i.e., a plane partition chosen at random according to the uniform distribution on all plane partitions whose solid Young diagrams…
We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…
The Canadian traveler problem (CTP) is the problem of traversing a given graph, where some of the edges may be blocked - a state which is revealed only upon reaching an incident vertex. Originally stated by Papadimitriou and Yannakakis…
A conjecture of Berge suggests that every bridgeless cubic graph can have its edges covered with at most five perfect matchings. Since three perfect matchings suffice only when the graph in question is $3$-edge-colourable, the rest of cubic…
We examine maximum vertex coloring of random geometric graphs, in an arbitrary but fixed dimension, with a constant number of colors. Since this problem is neither scale-invariant nor smooth, the usual methodology to obtain limit laws…
Inside a two dimensional region ("cake"), there are $m$ non-overlapping tiles of a certain kind ("toppings"). We want to expand the toppings while keeping them non-overlapping, and possibly add some blank pieces of the same "certain kind",…
Three-dimensional Yang-Mills-Chern-Simons theory has the peculiar property that its one-form symmetry defects have non-trivial braiding, namely they are charged under the same symmetry they generate, which is then anomalous. This poses a…
A tiling of the sphere by triangles, squares, or hexagons is convex if every vertex has at most 6, 4, or 3 polygons adjacent to it, respectively. Assigning an appropriate weight to any tiling, our main result is explicit formulas for the…
A single-vertex origami is a piece of paper with straight-line rays called creases emanating from a fold vertex placed in its interior or on its boundary. The Single-Vertex Origami Flattening problem asks whether it is always possible to…
A coloring of a complete bipartite graph is shuffle-preserved if it is the case that assigning a color $c$ to edges $(u, v)$ and $(u', v')$ enforces the same color assignment for edges $(u, v')$ and $(u',v)$. (In words, the induced subgraph…
A polyomino is called a development if it can make a box by folding edges of unit squares forming the polyomino. It is known that there are developments that can fold into a box (or boxes) in multiple ways. In this work, we conducted a…