English
Related papers

Related papers: An Eberhard-like theorem for pentagons and heptago…

200 papers

Given $2k-1$ convex sets in $R^2$ such that no point of the plane is covered by more than $k$ of the sets, is it true that there are two among the convex sets whose union contains all $k$-covered points of the plane? This question due to…

Combinatorics · Mathematics 2019-12-18 Adam S. Jobson , André E. Kézdy , Jenő Lehel , Timothy J. Pervenecki , Géza Tóth

A polyhedral graph is a $3$-connected planar graph. We find the least possible order $p(k,a)$ of a polyhedral graph containing a $k$-independent set of size $a$ for all positive integers $k$ and $a$. In the case $k = 1$ and $a$ even, we…

Combinatorics · Mathematics 2023-01-02 Sébastien Gaspoz , Riccardo W. Maffucci

For a $k$-uniform hypergraph $H$, let $\delta_1(H)$ denote the minimum vertex degree of $H$, and $\nu(H)$ denote the size of the largest matching in $H$. In this paper, we show that for any $k\geq 3$ and $\beta>0$, there exists an integer…

Combinatorics · Mathematics 2022-09-21 Mingyang Guo , Hongliang Lu , Yaolin Jiang

Let the numbers $\alpha_n,\beta_n$ and $\gamma_n$ denote \begin{align*} \alpha_n=\sum_{k=0}^{n-1}{2k\choose k},\quad \beta_n=\sum_{k=0}^{n-1}{2k\choose k}\frac{1}{k+1}\quad\text{and}\quad \gamma_n=\sum_{k=0}^{n-1}{2k\choose…

Number Theory · Mathematics 2017-08-31 Ji-Cai Liu

Given $s \ge k\ge 3$, let $h^{(k)}(s)$ be the minimum $t$ such that there exist arbitrarily large $k$-uniform hypergraphs $H$ whose independence number is at most polylogarithmic in the number of vertices and in which every $s$ vertices…

Combinatorics · Mathematics 2020-05-13 Dhruv Mubayi , Alexander Razborov

For any positive integers $m$ and $\alpha$, we prove that $$\sum_{k=0}^{n-1}\epsilon^k(2k+1)A_k^{(\alpha)}(x)^m\equiv0\pmod{n}, $$ where $\epsilon\in\{1,-1\}$ and $$…

Number Theory · Mathematics 2011-08-09 Hao Pan

The 1-2-3 conjecture has been solved positively in 2024 for finite graphs and by extension for infinite graphs which are locally finite. The solution is non-constructive, and finding explicit solutions for large (or infinite) graphs is very…

Combinatorics · Mathematics 2026-04-17 Alison Charlesworth , Christopher Ramsey , Nicolae Strungaru

Let $\mathcal{R}_k(n)$ be the number of representations of an integer $n$ as the sum of a prime and a $k$-th power. Define E_k(X) := |\{n \le X, n \in I_k, n\text{not a sum of a prime and a $k$-th power}\}|. Hardy and Littlewood conjectured…

Number Theory · Mathematics 2011-06-15 Aran Nayebi

Kneser-Haken Finiteness asserts that for each compact 3-manifold M there is an integer c(M) such that any collection of k>c(M) closed, essential, 2-sided surfaces in M must contain parallel elements. We show here that if M is closed then…

Geometric Topology · Mathematics 2007-05-23 David Bachman

A perfect Euler cuboid is a rectangular parallelepiped with integer edges, with integer face diagonals, and with integer space diagonal as well. Finding such parallelepipeds or proving their non-existence is an old unsolved mathematical…

Number Theory · Mathematics 2012-06-29 Ruslan Sharipov

Let $k$ and $\ell$ be positive integers. We prove that if $1 \leq \ell \leq o_k(k^{6/5})$, then in every large enough graph $G$, the fraction of $k$-vertex subsets that induce exactly $\ell$ edges is at most $1/e + o_k(1)$. Together with a…

Combinatorics · Mathematics 2021-08-12 Anders Martinsson , Frank Mousset , Andreas Noever , Miloš Trujić

We present new examples of topologically convex edge-ununfoldable polyhedra, i.e., polyhedra that are combinatorially equivalent to convex polyhedra, yet cannot be cut along their edges and unfolded into one planar piece without overlap.…

Computational Geometry · Computer Science 2020-07-30 Erik D. Demaine , Martin L. Demaine , David Eppstein

We consider four problems. Rogers proved that for any convex body $K$, we can cover ${\mathbb R}^d$ by translates of $K$ of density very roughly $d\ln d$. First, we extend this result by showing that, if we are given a family of positive…

Metric Geometry · Mathematics 2017-03-09 Nóra Frankl , János Nagy , Márton Naszódi

In this paper we will show the existence of a face $2$-colourable biembedding of the complete graph onto an orientable surface where each face is a cycle of a fixed length $k$, for infinitely many values of $k$. In particular, under certain…

Combinatorics · Mathematics 2019-08-12 Nicholas J. Cavenagh , D. Donovan , E. Ş. Yazici

A positive integer $n$ is said to be $k$-layered if its divisors can be partitioned into $k$ sets with equal sum. In this paper, we start the systematic study of these class of numbers. In particular, we state some algorithms to find some…

Number Theory · Mathematics 2022-07-20 Farid Jokar

We present an approach to proving the 2-log-convexity of sequences satisfying three-term recurrence relations. We show that the Apery numbers, the Cohen-Rhin numbers, the Motzkin numbers, the Fine numbers, the Franel numbers of order 3 and…

Combinatorics · Mathematics 2010-09-14 William Y. C. Chen , Ernest X. W. Xia

We study simplices with equiareal faces in the Euclidean 3-space by means of elementary geometry. We present an unexpectedly simple proof of the fact that, if such a simplex is non-degenerate, than every two of its faces are congruent. We…

Metric Geometry · Mathematics 2009-09-11 Victor Alexandrov , Nadezhda Alexandrova , Gunter Weiss

Given a number field $k$ and a positive integer $d$, in this paper we consider the following question: does there exist a smooth diagonal surface of degree $d$ in $\mathbb{P}^3$ over $k$ which contains a line over every completion of $k$,…

Number Theory · Mathematics 2015-12-16 Jörg Jahnel , Daniel Loughran

In this paper, we establish that the non-zero dihedral angles of hyperbolic Coxeter polyhedra of large dimensions are not arbitrarily small. Namely, for dimensions $n\geq 32$, they are of the form $\frac{\pi}{m}$ with $m\leq 6$. Moreover,…

Combinatorics · Mathematics 2025-07-08 Naomi Bredon

The Tur\'an hypergraph problem asks to find the maximum number of $r$-edges in a $r$-uniform hypergraph on $n$ vertices that does not contain a clique of size $a$. When $r=2$, i.e., for graphs, the answer is well-known and can be found in…

Combinatorics · Mathematics 2016-10-14 Annie Raymond
‹ Prev 1 8 9 10 Next ›