English
Related papers

Related papers: Tur\'an densities of hypercubes

200 papers

The density conjecture of Bers, Sullivan and Thurston predicts that each complete hyperbolic 3-manifold M with finitely generated fundamental group is an algebraic limit of geometrically finite hyperbolic 3-manifolds. We prove that the…

Geometric Topology · Mathematics 2007-05-23 Jeffrey F. Brock , Kenneth W. Bromberg

The cube Q is the usual 8-vertex graph with 12 edges. Here we give a new proof for a theorem of Erd\H{o}s and Simonovits concerning the Tur\'an number of the cube. Namely, it is shown that e(G) < n^{8/5}+(2n)^{3/2} holds for any n-vertex…

Combinatorics · Mathematics 2013-07-04 Zoltán Füredi

For fixed integers $r\ge 3, e\ge 3$, and $v\ge r+1$, let $f_r(n,v,e)$ denote the maximum number of edges in an $n$-vertex $r$-uniform hypergraph in which the union of arbitrary $e$ distinct edges contains at least $v+1$ vertices. In 1973,…

Combinatorics · Mathematics 2022-10-21 Chong Shangguan

Given two $r$-uniform hypergraphs $G$ and $H$ the Tur\'an number $\rm{ex}(G, H)$ is the maximum number of edges in an $H$-free subgraph of $G$. We study the typical value of $\rm{ex}(G, H)$ when $G=G_{n,p}^{(r)}$, the Erd\H{o}s-R\'enyi…

Combinatorics · Mathematics 2023-05-01 Dhruv Mubayi , Liana Yepremyan

We prove that the combination of strict positivity of $k$-tri-Ricci curvature with non-negative $3$-intermediate Ricci curvature forces rigidity of two-sided stable free boundary minimal hypersurface in a 5-manifold with bounded geometry…

Differential Geometry · Mathematics 2025-10-01 Jia Li

Given a graph $F$, we consider the problem of determining the densest possible pseudorandom graph that contains no copy of $F$. We provide an embedding procedure that improves a general result of Conlon, Fox, and Zhao which gives an upper…

Combinatorics · Mathematics 2024-11-20 Xizhi Liu , Dhruv Mubayi , David Munhá Correia

For integers $1\le \ell<k$, the $\ell$-degree Tur\'an density $\pi_\ell(F)$ measures the minimum $\ell$-degree threshold that forces a copy of a fixed $k$-uniform hypergraph $F$, generalizing both the classical Tur\'an density $\pi_1$ and…

Combinatorics · Mathematics 2026-03-09 Laihao Ding , Hong Liu , Haotian Yang

We use techniques from algebraic and extremal combinatorics to derive upper bounds on the number of independent sets in several (hyper)graphs arising from finite geometry. In this way, we obtain asymptotically sharp upper bounds for partial…

Combinatorics · Mathematics 2024-04-09 Sam Mattheus , Geertrui Van de Voorde

We propose a strengthening of the conclusion in Tur\'an's (3,4)-conjecture in terms of algebraic shifting, and show that its analogue for graphs does hold. In another direction, we generalize the Mantel-Tur\'an theorem by weakening its…

Combinatorics · Mathematics 2018-02-13 Gil Kalai , Eran Nevo

Keevash, Lenz and Mubayi developed a general criterion for hypergraph spectral extremal problems in their seminal work (SIAM J. Discrete Math., 2014). Their framework shows that extremal results on the $\alpha$-spectral radius (for $\alpha…

Combinatorics · Mathematics 2025-09-05 Jian Zheng , Honghai Li , Yi-Zheng Fan

The invariant integration method for Chern-Simons theory for gauge group SU(2) and manifold \Gamma\H^3 is verified in the semiclassical approximation. The semiclassical limit for the partition function associated with a connected sum of…

High Energy Physics - Theory · Physics 2009-10-31 A. A. Bytsenko , A. E. Goncalves , W. da Cruz

Given a family of $r$-uniform hypergraphs ${\cal F}$ (or $r$-graphs for brevity), the Tur\'an number $ex(n,{\cal F})$ of ${\cal F}$ is the maximum number of edges in an $r$-graph on $n$ vertices that does not contain any member of ${\cal…

Combinatorics · Mathematics 2015-10-14 Axel Brandt , David Irwin , Tao Jiang

In this paper, we study the maximum number of edges in an $N$-vertex $r$-uniform hypergraph with girth $g$ where $g \in \{5,6 \}$. Writing $\textrm{ex}_r ( N, \mathcal{C}_{<g} )$ for this maximum, it is shown that $\textrm{ex}_r ( N ,…

Combinatorics · Mathematics 2024-04-03 Kathryn Haymaker , Michael Tait , Craig Timmons

We show that a Kleinian surface group, or hyperbolic 3-manifold with a cusp-preserving homotopy-equivalence to a surface, has bounded geometry if and only if there is an upper bound on an associated collection of coefficients that depend…

Geometric Topology · Mathematics 2009-11-07 Yair N. Minsky

We investigate two conjectured spectral graph theoretic strengthenings of Tur\'an's theorem. Let $\mu_1 \ge \ldots \ge \mu_n$ denote the eigenvalues of a graph $G$ with $n$ vertices, $m$ edges and clique number $\omega(G)$. The concise…

Combinatorics · Mathematics 2023-12-21 Clive Elphick , William Linz , Pawel Wocjan

For ordinary graphs it is known that any graph $G$ with more edges than the Tur{\'a}n number of $K_s$ must contain several copies of $K_s$, and a copy of $K_{s+1}^-$, the complete graph on $s+1$ vertices with one missing edge. Erd\H{o}s…

Combinatorics · Mathematics 2011-11-28 Klas Markström

In this paper we study congruent and non-congruent hyperball (hypersphere) packings of the truncated regular tetrahedron tilings. These are derived from the Coxeter simplex tilings $\{p,3,3\}$ $(7\le p \in \mathbb{N})$ and $\{5,3,3,3,3\}$…

Metric Geometry · Mathematics 2015-10-13 Jenő Szirmai

We extend to the context of hyperbolic 3-manifolds with geodesic boundary Thurston's approach to hyperbolization by means of geometric triangulations. In particular, we introduce moduli for (partially) truncated hyperbolic tetrahedra, and…

Geometric Topology · Mathematics 2007-05-23 R. Frigerio , C. Petronio

The $3$-uniform tight $\ell$-cycle minus one edge $C_{\ell}^{3-}$ is the $3$-graph on $\ell$ vertices consisting of $\ell-1$ consecutive triples in the cyclic order. We show that for every integer $\ell \ge 5$ satisfying $\ell\not\equiv…

Combinatorics · Mathematics 2025-07-02 Levente Bodnár , Jinghua Deng , Jianfeng Hou , Xizhi Liu , Hongbin Zhao

In 1975, Erd\H{o}s asked for the maximum number of edges that an $n$-vertex graph can have if it does not contain two edge-disjoint cycles on the same vertex set. It is known that Tur\'an-type results can be used to prove an upper bound of…

Combinatorics · Mathematics 2024-04-11 Debsoumya Chakraborti , Oliver Janzer , Abhishek Methuku , Richard Montgomery