English
Related papers

Related papers: Bollob\'as-Meir TSP Conjecture Holds Asymptoticall…

200 papers

A digraph $D$ is $k$-linked if for every $2k$ distinct vertices $ x_1,\ldots , x_k, y_1, \ldots , y_k$ in $D$, there exist $k$ pairwise vertex-disjoint paths $P_1,\ldots, P_k$ such that $P_i$ starts at $x_i$ and ends at $y_i$ for each $i\in…

Combinatorics · Mathematics 2025-07-31 Jia Zhou , Jin Yan

A conjecture of Verstra\"ete states that for any fixed $\ell < k$ there exists a positive constant $c$ such that any $C_{2k}$-free graph $G$ contains a $C_{2\ell}$-free subgraph with at least $c |E(G)|$ edges. For $\ell = 2$, this…

Combinatorics · Mathematics 2025-01-24 David Conlon , Eion Mulrenin , Cosmin Pohoata

We study the asymptotic expansion for the Landau constants $G_n$, \begin{equation*} \pi G_{n}\sim \ln(16N)+\gamma+\sum^{\infty}_{k=1}\frac{\alpha_k}{N^k} ~~\mbox{as} ~ n\rightarrow\infty, \end{equation*} where $N=n+1$, and $\gamma$ is…

Classical Analysis and ODEs · Mathematics 2016-03-18 Chun-Ru Zhao , Wen-Gao Long , Yu-Qiu Zhao

A conjecture of Verstra\"ete states that for any fixed $\ell < k$ there exists a positive constant $c$ such that any $C_{2k}$-free graph $G$ contains a $C_{2\ell}$-free subgraph with at least $c |E(G)|$ edges. For $\ell = 2$, this…

Combinatorics · Mathematics 2026-03-26 David Conlon , Eion Mulrenin , Cosmin Pohoata

We show that there is an absolute constant $c>0$ such that every large connected $n$-vertex Cayley graph with degree $d\geq n^{1-c}$ has a Hamilton cycle. This makes progress towards the Lov\'asz conjecture and improves upon the previous…

Combinatorics · Mathematics 2026-04-21 Benjamin Bedert , Nemanja Draganić , Alp Müyesser , Matías Pavez-Signé

A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…

Computational Complexity · Computer Science 2026-05-14 Christopher Williamson

Let $Q^d$ be the $d$-dimensional binary hypercube. We form a random subgraph $Q^d_p\subseteq Q^d$ by retaining each edge of $Q^d$ independently with probability $p$. We show that, for every constant $\varepsilon>0$, there exists a constant…

Combinatorics · Mathematics 2025-05-08 Michael Anastos , Sahar Diskin , Joshua Erde , Mihyun Kang , Michael Krivelevich , Lyuben Lichev

Consider the problem of maximizing the probability of stopping with one of the two highest values in a Bernoulli random walk with arbitrary parameter $p$ and finite time horizon $n$. Allaart \cite{Allaart} proved that the optimal strategy…

Probability · Mathematics 2017-11-27 José A. Islas

A celebrated unresolved conjecture of Peter Frankl states that every finite union-closed collection of sets ($B$), with non-empty universe, admits an abundant element. The best result in the literature states that if $|B|=n$, then there…

Combinatorics · Mathematics 2021-06-17 Acquaah Peter

A well-known conjecture of Caratheodory states that the number of umbilic points on a closed convex surface in ${\mathbb E}^3$ must be greater than one. In this paper we prove this for $C^{3+\alpha}$-smooth surfaces. The Conjecture is first…

Differential Geometry · Mathematics 2025-01-20 Brendan Guilfoyle , Wilhelm Klingenberg

In 2013, Koldobsky posed the problem to find a constant $d_n$, depending only on the dimension $n$, such that for any origin-symmetric convex body $K\subset\mathbb{R}^n$ there exists an $(n-1)$-dimensional linear subspace…

Metric Geometry · Mathematics 2024-01-26 Ansgar Freyer , Martin Henk

The lonely runner conjecture of Wills and Cusick asserts that if $n$ runners with distinct constant speeds run around a a circular unit length track, starting at a common time and place, then each runner will at some time be separated by a…

Combinatorics · Mathematics 2025-11-21 Benjamin Bedert

The paper substantiates the conjecture of the asymptotic behavior of the largest distance between consecutive primes: $sup_{p_i \leq x}(p_{i+1}-p_i) \sim 2e^{-\gamma} \log^2(x)$, where $\gamma$ is the Euler constant. The Hardy-Littlewood…

General Mathematics · Mathematics 2020-04-30 Victor Volfson

Let $M^d$ denote the $d$-dimensional Euclidean, hyperbolic, or spherical space. The $r$-dual set of given set in $M^d$ is the intersection of balls of radii $r$ centered at the points of the given set. In this paper we prove that for any…

Metric Geometry · Mathematics 2018-02-12 Karoly Bezdek

The k-means problem consists of finding k centers in the d-dimensional Euclidean space that minimize the sum of the squared distances of all points in an input set P to their closest respective center. Awasthi et. al. recently showed that…

Computational Geometry · Computer Science 2015-09-04 Euiwoong Lee , Melanie Schmidt , John Wright

Astorg and Boc Thaler studied the dynamics of certain skew-product tangent to the identity on $\mathbb{C}^2$, with two real parameters $\alpha>1$ and $\beta$ derived from its coefficients. They proved that if there exists an increasing…

Dynamical Systems · Mathematics 2026-04-20 Zhangchi Chen , Zihao Ye , Weizhe Zheng

We prove that any finite energy geodesic ray with a finite Mabuchi slope is maximal in the sense of Berman-Boucksom-Jonsson, and reduce the proof of the uniform Yau-Tian-Donaldson conjecture for constant scalar curvature K\"{a}hler metrics…

Differential Geometry · Mathematics 2021-03-30 Chi Li

Consider a random uniform sample of $n$ points in a compact region $A$ of Euclidean $d$-space, $d \geq 2$, with a smooth or (when $d=2$) polygonal boundary. Fix $k \in {\bf N}$. Let $T_{n,k}$ be the threshold $r$ at which the geometric…

Probability · Mathematics 2024-07-18 Mathew D. Penrose , Xiaochuan Yang

Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let G(n,p) denote a random graph on n vertices with edge probability p. Bollobas, Catlin and Erdos asymptotically…

Combinatorics · Mathematics 2007-05-23 N. Fountoulakis , D. Kühn , D. Osthus

Erd\H{o}s, Faudree, Rousseau and Schelp observed the following fact for every fixed integer $k\geq 2$: Every graph on $n\geq k-1$ vertices with at least $(k-1)(n-k+2)+{k-2\choose 2}$ edges contains a subgraph with minimum degree at least…

Combinatorics · Mathematics 2018-06-28 Lisa Sauermann
‹ Prev 1 8 9 10 Next ›