Tur��n Numbers for Disjoint Copies of Graphs

The Turán number ex(n,H){ex(n,mathcal H)} of H{mathcal H} is the maximum number of edges of an n-vertex simple graph having no member of H{mathcal H} as a subgraph. We show lower and upper bounds for Turán numbers for disjoint copies of graphs.     

On A Hypergraph Turán Problem Of Frankl

Let be the 2k-uniform hypergraph obtained by letting P₁, . . .,P_r be pairwise disjoint sets of size k and taking as edges all sets P_i∪P_j with i ≠ j. This can be thought of as the ‘k-expansion’ of the complete graph K_r: each vertex has been replaced with a set of size k. An example of a hypergraph with vertex set V that does not contain can be obtained by partitioning V = V1 ∪V₂ and taking as edges all sets of size 2k that intersect each of V₁ and V₂ in an odd number of elements. Let denote a hypergraph on n vertices obtained by this construction that has as many edges as possible. For n sufficiently large we prove a conjecture of Frankl, which states that any hypergraph on n vertices that contains no has at most as many edges as . Sidorenko has given an upper bound of for the Tur′an density of for any r, and a construction establishing a matching lower bound when r is of the form 2^p+1. In this paper we also show that when r=2^p+1, any -free hypergraph of density looks approximately like Sidorenko’s construction. On the other hand, when r is not of this form, we show that corresponding constructions do not exist and improve the upper bound on the Turán density of to , where c(r) is a constant depending only on r. The backbone of our arguments is a strategy of first proving approximate structure theorems, and then showing that any imperfections in the structure must lead to a suboptimal configuration. The tools for its realisation draw on extremal graph theory, linear algebra, the Kruskal–Katona theorem and properties of Krawtchouck polynomials. * Research supported in part by NSF grants DMS-0355497, DMS-0106589, and by an Alfred P. Sloan fellowship.     

A Note on Turán Numbers for Even Wheels

The Turán number ex(n, G) is the maximum number of edges in any n-vertex graph that does not contain a subgraph isomorphic to G. We consider a very special case of the Simonovits’s theorem (Simonovits in: Theory of graphs, Academic Press, New York, 1968) which determine an asymptotic result for Turán numbers for graphs with some properties. In the paper we present a more precise result for even wheels. We provide the exact value for Turán number ex(n, W _2k ) for n ≥ 6k ? 10 and k ≥ 3. In addition, we show that ${ex(n,W_6)= \lfloor\frac{n^2}{3}\rfloor}$ for all n ≥ 6. These numbers can be useful to calculate some Ramsey numbers.     

Explicit evaluations of Turán expressions

Summary Positive representations for [P _n ^(λ) (x)]²−P _n ^−1/(λ) (x)P _n ^+1/(λ) (x) and for analogous expressions involving orthogonal polynomials are obtained. This is an excerpt from the author's doctoral dissertation, written under the direction of ProfessorW. Seidel, to whom the author is grateful for his encouragement and assistance.     

Tiling Turán Theorems

H in a large graph G. Received June 2, 1998     

Notes on a problem of Turán

Let z1,z2, ... ,znbe complex numbers, and write S= z ^j _{1 + ... +} z ^j _n for their power sums. Let R _n= min_{z 1,z2,...,zn} max_1≤j≤n |Sj| where the minimum is taken under the condition that max_1≤t≤n |z_t| = 1 Improving a result of Komlós, Sárközy and Szemerédi (see [KSSz]) we prove here that Rn <1 -(1 - ") log log n /log n We also discuss a related extremal problem which occurred naturally in our earlier proof ([B1]) of the fact that Rn >½     

On the Turán Density of Uniform Hypergraphs

Acta Mathematicae Applicatae Sinica, English Series - Let p, q be two positive integers. The 3-graph F(p, q) is obtained from the complete 3-graph K 3 by adding q new vertices and $$p(_2^q)$$ new...     

ON possible Turán densities

The Turán density π(F) of a family F of k-graphs is the limit as n → ∞ of the maximum edge density of an F-free k-graph on n vertices. Let Π _∞ ^(k) consist of all possible Turán densities and let Π _fin ^(k) ? Π _∞ ^(k) be the set of Turán densities of finite k-graph families. Here we prove that Π _fin ^(k) contains every density obtained from an arbitrary finite construction by optimally blowing it up and using recursion inside the specified set of parts. As an application, we show that Π _fin ^(k) contains an irrational number for each k ≥ 3. Also, we show that Π _∞ ^(k) has cardinality of the continuum. In particular, Π _∞ ^(k) ≠ Π _fin ^(k) .     

Two Turán type inequalities

Turán’s book [2], in Section 19.4, refers to the following result of Gábor Halász. Let a ₀, a ₁, ..., a _n−1 be complex numbers such that the roots α ₁, ⋯, α _n of the polynomial x ⁿ + a _n−1 x ⁿ⁻¹ + ⋯ + a ₁ x + a ₀ satisfy min _j Re α _j ≧ 0 and let function Y(t) be a solution of the linear differential equation Y ⁽ⁿ⁾ + a _n−1 Y ⁽ⁿ⁻¹⁾ + ⋯ + a ₁ Y′ + a ₀ Y = 0. Then

Turán numbers for odd wheels

The Turán number $\text{ex}(n,G)$ is the maximum number of edges in any $n$-vertex graph that does not contain a subgraph isomorphic to $G$. A wheel$W_n$ is a graph on $n$ vertices obtained from a $C_{n?1}$ by adding one vertex $w$ and making $w$ adjacent to all vertices of the $C_{n?1}$. We obtain two exact values for small wheels:

$\text{ex}(n,W_5)=?\frac{n^2}{4}+\frac{n}{2}?,$

$\text{ex}(n,W_7)=?\frac{n^2}{4}+\frac{n}{2}+1?.$

Given that $\text{ex}(n,W_6)$ is already known, this paper completes the spectrum for all wheels up to 7 vertices. In addition, we present the construction which gives us the lower bound $\text{ex}(n,W_{2k+1})>?\frac{n^2}{4}?+?\frac{n}{2}?$ in general case.     

Turán numbers of vertex-disjoint cliques in r-partite graphs

For two graphs $G$ and $H$, the Turán number$ex(G,H)$ is the maximum number of edges in a subgraph of $G$ that contains no copy of $H$. Chen, Li, and Tu determined the Turán numbers $ex(K_{m,n},k{K}_2)$ for all $k\ge 1$ Chen et al. (2009). In this paper we will determine the Turán numbers $ex(K_{a_1,\dots ,a_r},k{K}_r)$ for all $r\ge 3$ and $k\ge 1$.     

On a phenomenon of Turán concerning the summands of partitions

Turán [12] proved that for almost all pairs of partitions of an integer, the proportion of common parts is very high, that is greater than \({\frac{1}{2} - \varepsilon}\) with \({\varepsilon > 0}\) arbitrarily small. In this paper we prove that this surprising phenomenon persists when we look only at the summands in a fixed arithmetic progression.     

A note on the Structure of Turán Densities of Hypergraphs

Let r ≥ 2 be an integer. A real number α ∈ [0, 1) is a jump for r if there exists c > 0 such that no number in (α, α + c) can be the Turán density of a family of r-uniform graphs. A result of Erd?s and Stone implies that every α ∈ [0, 1) is a jump for r = 2. Erd?s asked whether the same is true for r ≥ 3. Frankl and Rödl gave a negative answer by showing an infinite sequence of non-jumps for every r ≥ 3. However, there are still a lot of open questions on determining whether or not a number is a jump for r ≥ 3. In this paper, we first find an infinite sequence of non-jumps for r = 4, then extend one of them to every r ≥ 4. Our approach is based on the techniques developed by Frankl and Rödl.     

On a Turán type problem of Erdös

Let L ^k be the graph formed by the lowest three levels of the Boolean lattice B _k , i.e.,V(L ^k )={0, 1,...,k, 12, 13,..., (k–1)k} and 0is connected toi for all 1ik, andij is connected toi andj (1i<jk).It is proved that if a graph G overn vertices has at leastk ^3/2 n ^3/2 edges, then it contains a copy of L ^k .Research supported in part by the Hungarian National Science Foundation under Grant No. 1812     

Turán number and decomposition number of intersecting odd cycles

Given a graph $H$, the Turán function $\mathrm{ex}(n,H)$ is the maximum number of edges in a graph on $n$ vertices that does not contain $H$ as a subgraph. Let $s,t$ be integers and let $H_{s,t}$ be a graph consisting of $s$ triangles and $t$ cycles of odd lengths at least 5 which intersect in exactly one common vertex. Erd?s et al. (1995) determined the Turán function $\mathrm{ex}(n,H_{s,0})$ and the corresponding extremal graphs. Recently, Hou et al. (2016) determined $\mathrm{ex}(n,H_{0,t})$ and the extremal graphs, where the $t$ cycles have the same odd length $q$ with $q?5$. In this paper, we further determine $\mathrm{ex}(n,H_{s,t})$ and the extremal graphs, where $s?0$ and $t?1$. Let $?(n,H)$ be the smallest integer such that, for all graphs $G$ on $n$ vertices, the edge set $E\left(G\right)$ can be partitioned into at most $?(n,H)$ parts, of which every part either is a single edge or forms a graph isomorphic to $H$. Pikhurko and Sousa conjectured that $?(n,H)=\mathrm{ex}(n,H)$ for $\chi \left(H\right)?3$ and all sufficiently large $n$. Liu and Sousa (2015) verified the conjecture for $H_{s,0}$. In this paper, we further verify Pikhurko and Sousa’s conjecture for $H_{s,t}$ with $s?0$ and $t?1$.     

On key applications of the Turán–Kubilius inequality

Lithuanian Mathematical Journal - After briefly describing the origin and the scope of the Turán–Kubilius inequality, we show how this important inequality leads to the law of large...