English
Related papers

Related papers: Strongly sublinear separators and bounded asymptot…

200 papers

Fix $d\geq2$ and let $f_{t}(z)=z^{d}+t$ be the family of polynomials parameterized by $t\in\mathbb{C}$. In this article, we will show that there exists a constant $C(d)$ such that for any $a,b\in\mathbb{C}$ with $a^{d}\neq b^{d}$, the…

Number Theory · Mathematics 2023-02-14 Hang Fu

We introduce the notion of delineation. A graph class $\mathcal C$ is said delineated if for every hereditary closure $\mathcal D$ of a subclass of $\mathcal C$, it holds that $\mathcal D$ has bounded twin-width if and only if $\mathcal D$…

Data Structures and Algorithms · Computer Science 2022-04-05 Édouard Bonnet , Dibyayan Chakraborty , Eun Jung Kim , Noleen Köhler , Raul Lopes , Stéphan Thomassé

The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if, for every set of $k$ disjoint pairs of vertices, there are $k$ vertex-disjoint paths joining the…

Combinatorics · Mathematics 2023-10-13 Hoa T. Bui , Guillermo Pineda-Villavicencio , Julien Ugon

We show that the asymptotic dimension of a geodesic space that is homeomorphic to a subset in the plane is at most three. In particular, the asymptotic dimension of the plane and any planar graph is at most three.

Metric Geometry · Mathematics 2021-07-09 Koji Fujiwara , Panos Papasoglu

An independent transversal in a multipartite graph is an independent set that intersects each part in exactly one vertex. We show that for every even integer $r\ge 2$, there exist $c_r>0$ and $n_0$ such that every $r$-partite graph with…

Combinatorics · Mathematics 2025-04-08 Yantao Tang , Yi Zhao

Menger's theorem says that, for $k\ge0$, if $S, T$ are sets of vertices in a graph $G$, then either there are $k + 1$ vertex-disjoint paths between $S$ and $T$, or there is a set X of at most $k$ vertices such that every $S$-$T$ path passes…

Combinatorics · Mathematics 2025-09-10 Tung Nguyen , Alex Scott , Paul Seymour

We show that the subleading soft photon theorem in a $(d+2)$-dimensional massless abelian gauge theory gives rise to a Ward identity corresponding to divergent large gauge transformations acting on the celestial sphere at null infinity. We…

High Energy Physics - Theory · Physics 2020-01-08 Temple He , Prahar Mitra

Let $c_1, c_2, c_3$ be distinct complex numbers, and let $d\ge 3$ be an integer. We show that the set of all pairs $(a,b)\in \mathbb{C}\times \mathbb{C}$ such that each $c_i$ is preperiodic for the action of the polynomial $x^d+ax+b$ is not…

Dynamical Systems · Mathematics 2015-07-20 Dragos Ghioca , Liang-Chung Hsia , Thomas J. Tucker

Let M be a graph manifold. We prove that fundamental groups of embedded incompressible surfaces in M are separable in the fundamental group of M, and that the double cosets for crossing surfaces are also separable. We deduce that if there…

Geometric Topology · Mathematics 2014-01-17 Piotr Przytycki , Daniel T. Wise

Let $\Lambda$ be a numerical semigroup, $\mathcal{C}\subseteq \mathbb{A}^n$ the monomial curve singularity associated to $\Lambda$, and $\mathcal{T}$ its tangent cone. In this paper we provide a sharp upper bound for the least positive…

Commutative Algebra · Mathematics 2019-06-27 Alessio Sammartano

Let $G$ be a graph with the usual shortest-path metric. A graph is $\delta$-hyperbolic if for every geodesic triangle $T$, any side of $T$ is contained in a $\delta$-neighborhood of the union of the other two sides. A graph is chordal if…

Combinatorics · Mathematics 2017-08-22 Álvaro Martínez-Pérez

In this paper, we give a new class of rigid Coxeter groups. Let $(W,S)$ be a Coxeter system. Suppose that (0) for each $s,t\in S$ such that $m(s,t)$ is even, $m(s,t)=2$, (1) for each $s\neq t\in S$ such that $m(s,t)$ is odd, $\{s,t\}$ is a…

Group Theory · Mathematics 2007-05-23 Tetsuya Hosaka

Let $\mathcal{C}$ be a class of graphs that is closed under taking subgraphs. We prove that if for some fixed $0<\delta\le 1$, every $n$-vertex graph of $\mathcal{C}$ has a balanced separator of order $O(n^{1-\delta})$, then any depth-$k$…

Combinatorics · Mathematics 2017-10-31 Louis Esperet , Jean-Florent Raymond

The contact graph of a packing of translates of a convex body in Euclidean $d$-space $\mathbb E^d$ is the simple graph whose vertices are the members of the packing, and whose two vertices are connected by an edge if the two members touch…

Metric Geometry · Mathematics 2018-11-06 Károly Bezdek , Márton Naszódi

For large $n$ we determine exactly the maximum numbers of induced $C_4$ and $C_5$ subgraphs that a planar graph on $n$ vertices can contain. We show that $K_{2,n-2}$ uniquely achieves this maximum in the $C_4$ case, and we identify the…

Combinatorics · Mathematics 2021-09-29 Michael Savery

Inspired by a classical theorem of topological dimension theory, we prove that every geodesic metric space of asymptotic dimension $n$ containing a bi-infinite geodesic can be coarsely separated by a subset $S$ of asymptotic dimension equal…

Group Theory · Mathematics 2024-03-26 Panagiotis Tselekidis

A strongly regular graph with parameters $(n,d,a,c)$ is a $d$-regular graph of order $n$, in which every pair of adjacent vertices has exactly $a$ common neighbor(s) and every pair of nonadjacent vertices has exactly $c$ common neighbor(s).…

Combinatorics · Mathematics 2026-04-28 S. Morteza Mirafzal

For each $N\ge C_dt^d$ we prove the existence of a well separated spherical $t$-design in the sphere $S^d$ consisting of $N$ points, where $C_d$ is a constant depending only on $d$.

Metric Geometry · Mathematics 2013-07-12 Andriy Bondarenko , Danylo Radchenko , Maryna Viazovska

In this note we show that any inextensible time-symmetric space-like hypersurface of differentiability class $C^k$, $k\geq 2$ isometrically embedded in the maximal Schwarzschild geometry must intersect the bifurcation sphere.

General Relativity and Quantum Cosmology · Physics 2010-11-13 Alfonso García-Parrado Gómez-Lobo

We prove that for every complete graph $K_t$, all graphs $G$ with no induced subgraph isomorphic to a subdivision of $K_t$ have a stable subset of size at least $|G|/{\rm polylog}|G|$. This is close to best possible, because for $t\ge 7$,…

Combinatorics · Mathematics 2025-03-26 Tung Nguyen , Alex Scott , Paul Seymour
‹ Prev 1 4 5 6 7 8 10 Next ›