English
Related papers

Related papers: Finite planar emulators for K_{4,5} - 4K_2 and K_{…

200 papers

The Chen-Lih-Wu Conjecture states that each connected graph with maximum degree $\Delta\geq 3$ that is not the complete graph $K_{\Delta+1}$ or the complete bipartite graph $K_{\Delta,\Delta}$ admits an equitable coloring with $\Delta$…

Combinatorics · Mathematics 2023-11-14 Alexandr Kostochka , Duo Lin , Zimu Xiang

We show that a graph with $n$ vertices and vertex cover of size $k$ has at most $4^k + n$ potential maximal cliques. We also show that for each positive integer $k$, there exists a graph with vertex cover of size $k$, $O(k^2)$ vertices, and…

Combinatorics · Mathematics 2020-11-24 Tuukka Korhonen

We study extensions of the classic \emph{Line Cover} problem, which asks whether a set of $n$ points in the plane can be covered using $k$ lines. Line Cover is known to be NP-hard, and we focus on two natural generalizations. The first is…

Computational Geometry · Computer Science 2026-03-26 Matthias Bentert , Fedor v. Fomin , Petr A. Golovach , Souvik Saha , Sanjay Seetharaman , Kirill Simonov , Anannya Upasana

The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by k.

Data Structures and Algorithms · Computer Science 2012-04-24 Petr A. Golovach , Pim van 't Hof , Daniel Paulusma

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…

Metric Geometry · Mathematics 2026-02-25 Egor Bakaev , Amir Yehudayoff

The reconfiguration graph $R_k(G)$ of the $k$-colourings of a graph $G$ has as vertex set the set of all possible $k$-colourings of $G$ and two colourings are adjacent if they differ on the colour of exactly one vertex. Cereceda conjectured…

Discrete Mathematics · Computer Science 2018-10-02 Eduard Eiben , Carl Feghali

Almost $4$-connectivity is a weakening of $4$-connectivity which allows for vertices of degree three. In this paper we prove the following theorem. Let $G$ be an almost $4$-connected triangle-free planar graph, and let $H$ be an almost…

Combinatorics · Mathematics 2019-05-23 Sergey Norin , Robin Thomas

In this expository note we present a proof of the V.A. Vassiliev conjecture on the planarity of graphs with vertices of degree 4 and certain additional structure. Both statement and proof are accessible to high-school students familiar with…

Combinatorics · Mathematics 2018-10-02 Arkadiy Skopenkov

A planar framework -- a graph together with a map of its vertices to the plane -- is flexible if it allows a continuous deformation preserving the distances between adjacent vertices. Extending a recent previous result, we prove that a…

Combinatorics · Mathematics 2022-10-06 Sean Dewar , Jan Legerský

Two planar graphs G1 and G2 sharing some vertices and edges are `simultaneously planar' if they have planar drawings such that a shared vertex [edge] is represented by the same point [curve] in both drawings. It is an open problem whether…

Data Structures and Algorithms · Computer Science 2011-12-12 Bernhard Haeupler , Krishnam Raju Jampani , Anna Lubiw

We study the extension estimates for paraboloids in d-dimensional vector spaces over finite fields F_q with q elements. We use the connection between L^2 based restriction estimates and L^p\to L^r extension estimates for paraboloids. As a…

Classical Analysis and ODEs · Mathematics 2017-03-07 Doowon Koh

A 4-regular planar graph $G$ is said to be circle representable if there exists a collection of circles drawn on the plane such that the touching and crossing points correspond to the vertices of $G$, and the circular arcs between those…

Combinatorics · Mathematics 2019-08-14 Jane Tan

A sequence $S$ is potentially $K_{m}-P_{k}$ graphical if it has a realization containing a $K_{m}-P_{k}$ as a subgraph. Let $\sigma(K_{m}-P_{k}, n)$ denote the smallest degree sum such that every $n$-term graphical sequence $S$ with…

Combinatorics · Mathematics 2007-05-23 Chunhui Lai

A graph is diameter-$k$-critical if its diameter equals $k$ and the deletion of any edge increases its diameter. The Murty-Simon Conjecture states that for any diameter-2-critical graph $G$ of order $n$, $e(G) \leq \lfloor…

Combinatorics · Mathematics 2024-09-27 Xiaolin Wang , Yanbo Zhang , Xiutao Zhu

Let $V$ be a finite dimensional complex vector space and $W\subseteq \GL(V)$ be a finite complex reflection group. Let $V^{\reg}$ be the complement in $V$ of the reflecting hyperplanes. We prove that $V^{\reg}$ is a $K(\pi,1)$ space. This…

Geometric Topology · Mathematics 2014-01-24 David Bessis

For each nonnegative integer m we show that any closed, oriented topological four-manifold with fundamental group Z_{4m+2} and odd intersection form, with possibly seven exceptions, either admits no smooth structure or admits infinitely…

Geometric Topology · Mathematics 2024-06-14 R. Inanc Baykur , Andras I. Stipsicz , Zoltan Szabo

We obtain an effective enumeration of the family of finitely generated groups admitting a faithful, properly discontinuous action on some 2-manifold contained in the sphere. This is achieved by introducing a type of group presentation…

Combinatorics · Mathematics 2019-01-04 Agelos Georgakopoulos , Matthias Hamann

In the paper, we study special configurations of lines and points in the complex projective plane, so called k-nets. We describe the role of these configurations in studies of cohomology on arrangement complements. Our most general result…

Combinatorics · Mathematics 2016-09-07 Sergey Yuzvinsky

A complete structural characterization of graphs with no $K_{3,4}$ minor is obtained, and the following consequences are established. Every $4$-connected non-planar graph with at least seven vertices and minimum degree at least five…

Combinatorics · Mathematics 2026-03-31 On-Hei Solomon Lo

In this paper, we prove some new thickness theorems with partial derivatives. We give some applications. First, we give a simple criterion that can judge whether two scaled Cantor sets have non-empty intersection. Second, we prove under…

Dynamical Systems · Mathematics 2022-12-02 Kan Jiang