Related papers: Daisies and Other Turan Problems
There are four non-isomorphic configurations of triples that can form a triangle in a $3$-uniform hypergraph. Forbidding different combinations of these four configurations, fifteen extremal problems can be defined, several of which already…
This article is an exposition of certain connections between the braid groups, classical homotopy groups of the 2-sphere, as well as Lie algebras attached to the descending central series of pure braid groups arising as Vassiliev invariants…
In this paper, we prove several new Tur\'{a}n density results for $3$-graphs. We show: $\pi(C_4^3, \mathrm{complement\ of\ } F_5) = 2\sqrt{3} - 3$, $\pi(F_{3,2}, C_5^{3-}) = \frac{2}{9}$, and $\pi(F_{3,2}, \mathrm{induced\ complement\ of\ }…
In this note, using some regular triangular tilings of the sphere, the Euclidean plane and the hyperbolic plane, we examine the potential relationship between their discrete Bakry - Emery curvatures and the smooth curvatures of their…
Let $H$ be a graph on $n$ vertices and let the blow-up graph $G[H]$ be defined as follows. We replace each vertex $v_i$ of $H$ by a cluster $A_i$ and connect some pairs of vertices of $A_i$ and $A_j$ if $(v_i,v_j)$ was an edge of the graph…
We "solve" the Freed-Witten anomaly equation, i.e., we find a geometrical classification of the B-field and A-field configurations in the presence of D-branes that are anomaly-free. The mathematical setting being provided by the geometry of…
We survey results and open problems relating degree conditions with tree containment in graphs, random graphs, digraphs and hypergraphs, and their applications in Ramsey theory.
The Tur\'an number of a $k$-uniform hypergraph $H$, denoted by $e{x_k}\left({n;H} \right)$, is the maximum number of edges in any $k$-uniform hypergraph $F$ on $n$ vertices which does not contain $H$ as a subgraph. Let…
The planted densest subgraph detection problem refers to the task of testing whether in a given (random) graph there is a subgraph that is unusually dense. Specifically, we observe an undirected and unweighted graph on $n$ vertices. Under…
Two elliptic curves defined over $\mathbb{Q}$ are called discriminant twins if they have the same minimal discriminant and the same conductor. Deines, in 2014, conjectured that there exist infinitely many semi-stable non-isogenous…
We prove the density hypothesis for wide families of arithmetic orbifolds arising from all division quaternion algebras over all number fields of bounded degree. Our power-saving bounds on the multiplicities of non-tempered representations…
There is a family of hyperbolic groups known as hyperbolic hydra which contain heavily distorted free subgroups. We prove the existence of Cannon--Thurston maps (that is, maps of the boundaries induced by subgroup inclusion) for these free…
A rough structure theorem is proved for graphs $G$ containing no copy of a bounded degree tree $T$: from any such $G$, one can delete $o(|G||T|)$ edges in order to get a subgraph all of whose connected components have a cover of order…
Given a graph $F$, the random Tur\'an problem asks to determine the maximum number of edges in an $F$-free subgraph of $G_{n,p}$. Prior to this work, the only bipartite graphs $F$ with known tight bounds included certain classes of complete…
In this note we will discuss the notion of robust chaos, and show that (i) there are natural one-parameter families with robust chaos and (ii) hyperbolicity is dense within generic one-parameter families (and so these families are not…
We study sufficient conditions for Hamiltonian cycles in hypergraphs, and obtain both Tur\'an- and Dirac-type results. While the Tur\'an-type result gives an exact threshold for the appearance of a Hamiltonian cycle in a hypergraph…
A k-uniform linear cycle of length s is a cyclic list of k-sets A_1,..., A_s such that consecutive sets intersect in exactly one element and nonconsecutive sets are disjoint. For all k at least 5 and s at least 3 and sufficiently large n we…
An $r$-uniform hypergraph is called an $r$-graph. A hypergraph is linear if every two edges intersect in at most one vertex. Given a linear $r$-graph $H$ and a positive integer $n$, the linear Tur\'an number $ex_L(n,H)$ is the maximum…
Let $k\geq 3$. Given a $k$-uniform hypergraph $H$, the minimum codegree $\delta(H)$ is the largest $d\in\mathbb{N}$ such that every $(k-1)$-set of $V(H)$ is contained in at least $d$ edges. Given a $k$-uniform hypergraph $F$, the codegree…
Given a positive integer $n$ and an $r$-uniform hypergraph (or $r$-graph for short) $F$, the Turan number $ex(n,F)$ of $F$ is the maximum number of edges in an $r$-graph on $n$ vertices that does not contain $F$ as a subgraph. The extension…