Related papers: Daisies and Other Turan Problems
We study tangential families, i.e. systems of rays emanating tangentially from given curves. We classify, up to Left-Right equivalence, stable singularities of tangential family germs (under deformations among tangential families) and we…
For a graph $F$, an $r$-uniform hypergraph $H$ is a Berge-$F$ if there is a bijection $\phi:E(F)\rightarrow E(H)$ such that $e\subseteq \phi(e)$ for each $e\in E(F)$. Given a family $\mathcal{F}$ of $r$-uniform hypergraphs, an $r$-uniform…
Let $\mathcal{H}$ be an $r$-uniform hypergraph. The Tur\'{a}n number $\text{ex}(n,\mathcal{H})$ is the maximum number of edges in an $n$-vertex $\mathcal{H}$-free $r$-uniform hypergraph. The Tur\'{a}n density of $\mathcal{H}$ is defined by…
We present some open problems and describe briefly some possible research directions in the emerging theory of Hardy spaces of Dirichlet series and their intimate counterparts, Hardy spaces on the infinite-dimensional torus. Links to number…
An important question in extremal graph theory raised by Vera T. S\'os asks to determine for a given integer $t\ge 3$ and a given positive real number $\delta$ the asymptotically supremal edge density $f_t(\delta)$ that an $n$-vertex graph…
The Turan number of a graph H, ex(n,H), is the maximum number of edges in a graph on n vertices which does not have H as a subgraph. We determine the Turan number and find the unique extremal graph for forests consisting of paths when n is…
Given an $r$-graph $H$ on $h$ vertices, and a family $\mathcal{F}$ of forbidden subgraphs, we define $\ex_{H}(n, \mathcal{F})$ to be the maximum number of induced copies of $H$ in an $\mathcal{F}$-free $r$-graph on $n$ vertices. Then the…
In this short note we consider the oriented vertex Tur\'an problem in the hypercube: for a fixed oriented graph $\overrightarrow{F}$, determine the maximum size $ex_v(\overrightarrow{F}, \overrightarrow{Q_n})$ of a subset $U$ of the…
We construct cocompact lattices in a product of trees which are not virtually torsion-free. This gives the first examples of hierarchically hyperbolic groups which are not virtually torsion-free
Let $\mathscr{F}$ be a family of graphs. A graph $G$ is $\mathscr{F}$-free if $G$ does not contain any $F\in \mathscr{F}$ as a subgraph. The Tur\'an number, denoted by $ex(n, \mathscr{F})$, is the maximum number of edges in an $n$-vertex…
Very recently, Alon and Frankl, and Gerbner studied the maximum number of edges in $n$-vertex $F$-free graphs with bounded matching number, respectively. We consider the analogous Tur\'{a}n problems on hypergraphs with bounded matching…
The generation of a random triangle-saturated graph via the triangle-free process has been studied extensively. In this short note our aim is to introduce an analogous process in the hypercube. Specifically, we consider the $Q_2$-free…
Motivated by a Gan-Loh-Sudakov-type problem, we introduce the regular Tur\'an numbers, a natural variation on the classical Tur\'an numbers for which the host graph is required to be regular. Among other results, we prove a striking…
For an ordered graph $F$, denote the Tur\'an density by $\vec{\pi}(F)$. The relative Tur\'an density, denoted by $\rho(F)$, is the supremum over $\alpha \in [0,1]$ such that every ordered graph $G$ contains an $F$-free subgraph $G'$ with…
It is shown that for non-hyperbolic real quadratic polynomials topological and quasisymmetric conjugacy classes are the same. By quasiconformal rigidity, each class has only one representative in the quadratic family, which proves that…
We study two optimization problems for positive definite functions on Euclidean space with restrictions on their support and sign: the Turan problem and the Delsarte problem. These problems have been studied also for their connections to…
Given a graph $T$ and a family of graphs $\mathcal{F}$, the generalized Tur\'an number $\mathrm{ex}(n,T,\mathcal{F})$ is the maximum number of copies of $T$ in an $n$-vertex $\mathcal{F}$-free graph. We prove a general theorem which states…
In a ground-breaking paper solving a conjecture of Erd\H{o}s on the number of $n$-vertex graphs not containing a given even cycle, Morris and Saxton \cite{MS} made a broad conjecture on so-called balanced supersaturation property of a…
With an arbitrary finite graph having a special form of 2-intervals (a diamond-shaped graph) we associate a subgroup of a symmetric group and a representation of this subgroup; state a series of problems on such groups and their…
A Harris Graph is a tough, Eulerian, non-Hamiltonian graph. Several approaches to creating new Harris graphs from existing ones are explored, including creating families of Harris graphs and combining Harris graphs. Pictures of all Harris…