WorksMathematics
A note on Turán densities of daisies and hypergraph products
Abstract
The Turán density of an -uniform hypergraph is defined as , where denotes the largest number of edges in an -free -uniform hypergraph on vertices. For integers and , an -daisy is the -uniform hypergraph consisting of all unions of a fixed -set with the -subsets of a disjoint -set. We show that for every fixed , as . This bound is best possible up to the implicit constant by a classical result of de Caen, and it answers, in a stronger form, a question of Ellis, Ivan and Leader, who asked for the case . Moreover, we show a related result for matroid basis hypergraphs. We also consider Turán densities of hypergraph products, of which daisies are a special case. The product of two hypergraphs on disjoint vertex sets consists of all unions of an edge of the first with an edge of the second. For the product of disjoint copies of a fixed -uniform hypergraph that is not -partite, we show that exponentially fast as , and we determine the exponential rate in terms of the minimum number of edges in a homomorphic image of . This answers a question of Bollobás, Leader and Malvenuto up to a polynomial factor in , and we further address a related question of theirs for products of two different hypergraphs.
Introduction
An -uniform hypergraph , or -graph for short, consists of a finite vertex set and an edge set , where denotes the family of all subsets of of size . The complete -graph on vertices is denoted by , and we may also refer to 2-graphs simply as graphs. For an -graph and a set with , the link of is the -graph on with edge set . We call links of single vertices vertex links. For -graphs and , a copy of in is a subhypergraph of isomorphic to , and is -free if it contains no copy of . The extremal number is the largest number of edges in an -free -graph on vertices. The Turán density of is defined as
Here and throughout, the uniformity is always that of the hypergraph in question, and we do not indicate it explicitly in the notation. By a standard double counting argument, the sequence is nonincreasing in , so this density notion is well defined. We assume that all hypergraphs whose Turán density we consider have at least one edge and no isolated vertices. In asymptotic notation, the implicit constants may depend on the parameters given in the subscript. Throughout, denotes the natural logarithm.
Daisies. For integers and , an -daisy is an -graph with vertex set and edge set , where , , and . We denote this hypergraph by 2 and call its stem. The daisy has vertices and edges. A particular question for daisies, raised by Bollobás, Leader and Malvenuto [3], is how their Turán densities behave as the size of the stem grows. For fixed and , averaging over vertex links shows that is nonincreasing in , and thus exists.
It was conjectured in [3], and independently by Bukh as mentioned there, that this limit is zero for every fixed pair and with . Using a construction based on bases of an -dimensional vector space over a finite field, Ellis, Ivan and Leader [6] disproved this conjecture by showing that . In the same work, they further showed that as . The upper bound used for this result follows by an application of Turán’s theorem [22] to the links of -sets and was recently improved by Hou, Hou, Liu, Zeng and Zhang [13] to for all and . For larger even values of , Ellis, Ivan and Leader also obtained lower bounds by considering vector spaces of dimension larger than .
The underlying idea of their construction has since found further applications, for example to Turán problems in the hypercube, see [2, 7, 11, 16], while the construction itself has also been used in the context of erasure list-decodable codes by Alon [1] and of matroid basis hypergraphs by van der Pol, Walsh and Wigal [19]. More recently, Pikhurko, Yang and Zhu [18] considered hypergraph augmentations, which are obtained by adding the same set of new vertices to every edge of a fixed hypergraph. Their work implies, in particular, that as for every fixed .
However, for fixed , the aforementioned results do not determine the correct order of as . In fact, Ellis, Ivan and Leader [6] explicitly asked the following question for .
Problem 1. Is it true that as ?
Our first goal in this note is to answer this question, and in fact, to do so for every fixed . More specifically, we prove the following result, whose case answers Problem 1 in the affirmative.
Theorem 2. For every fixed integer ,
as $t\to\infty.
Note that, by monotonicity in , the same lower bound holds uniformly for all . Also, this bound is best possible up to the implicit constant, since the bound of de Caen [5] for and averaging over the links of -sets give for all , as discussed for in [6]. We shall also see how the ideas used to prove Theorem 2 can be applied to matroid basis hypergraphs.
:::
Hypergraph products. A more general problem related to daisies, concerning hypergraph products, was raised by Bollobás, Leader and Malvenuto [3]. Given an -graph and an -graph on disjoint vertex sets, their product is the -graph on with edge set
Note that a daisy is itself a product, since for the daisy is the product of with the -graph consisting of a single edge. Bollobás, Leader and Malvenuto [3 Problem 5] asked the following.
Problem 3. Let be an -graph and be an -graph. How does compare to and ?
A particularly interesting case, as pointed out in [3], is that of products of copies of a single hypergraph. Writing for the product of disjoint copies of , which we shall call the -th power of , Bollobás, Leader and Malvenuto [3 Problem 6] also asked the following.
Problem 4. Let be a fixed -graph. As varies, how does behave? In particular, what happens when ?
Hypergraph products have appeared in the context of Betti numbers [8] and Lagrangians [12], and results on their Turán densities are also known in the special case where one factor consists of a single edge, see [9, 6, 4, 18]. However, to the best of our knowledge, Problems 3 and 4 have not previously been addressed as originally posed. Our second goal in this note is to make progress on them, with the following parameter as the key ingredient.
A homomorphism from an -graph to an -graph is a map such that for every . In particular, is injective on every edge. We write if a homomorphism from to exists, and define
as the homomorphic edge number of . In other words, denotes the least number of edges in a homomorphic image of . For example, if and only if is -partite. Another example is given by for every , since an odd cycle maps onto a triangle, and every homomorphic image of an odd cycle is non-bipartite and therefore has at least three edges. We assume that all hypergraphs whose homomorphic edge number we consider have at least one edge and no isolated vertices. With this parameter at hand, we prove the following result on Problem 4.
Theorem 5. Let be an -graph. If is -partite, then for all . Otherwise, there is a constant such that, for every integer ,
The lower bound follows from a standard averaging argument applied to a homomorphic image of . Our main contribution here is to show that it is sharp up to a polynomial factor in and a constant depending only on .
Observe that for , since every pair of vertices of is contained in an edge and thus every homomorphism from is injective. Also, for every graph , since a proper vertex-colouring with colours is a homomorphism , and conversely every homomorphic image of satisfies . Since any two colour classes in a proper vertex-colouring of with colours are joined by an edge, it follows that . Using these observations, the following two results are immediate consequences of Theorem 5.
Corollary 6. Let be integers. There is a constant such that, for every integer ,
Corollary 7. Let be a graph. If is bipartite, then for all . Otherwise, there is a constant such that, for every integer ,
For Problem 3, we only make partial progress in the form of the following result, which, however, also points to the homomorphic edge number as a relevant parameter.
Proposition 8. Let be an -graph and be an -graph. Then
In the concluding remarks, we shall also give an example, based on Proposition 8, showing that is not determined by , and the uniformities of and alone.
Organisation. The remainder of this note is structured as follows. In § 2.1, we prove Theorem 2, and in § 2.2, we show a related result for matroid basis hypergraphs. In § 3, we prove Theorem 5 and Proposition 8, after giving two auxiliary results on homomorphisms. We close this note with some concluding remarks and further directions in § 4.
Daisies
The main purpose of this section is to prove Theorem 2. Our construction is essentially the same as that used by Ellis, Ivan and Leader [6] to prove their Theorems 5 and 10, with only a slight modification. The difference is that instead of retaining linearly independent sets of vectors in a space of dimension at least , we retain sets of vectors spanning . The reason for this is that spanning a space of dimension is a much weaker requirement on vectors than linear independence, and thus more -sets are retained. More specifically, vectors chosen independently and uniformly at random from fail to be linearly independent with probability about , whereas vectors chosen in the same way from fail to span it with probability only about , which also explains where the exponent comes from. Also, the smaller the dimension of the space, the more likely it is that random vectors span it, so we want the dimension to be as small as possible. At the same time, the dimension has to be large enough to avoid copies of , and for our construction this means that the quotient by the span of the vectors of a stem has dimension at least two. As a stem has vertices, this gives the dimension .
We make this precise in § 2.1, and in § 2.2 we apply the construction to matroid basis hypergraphs.
Proof of Theorem 2
We begin with the following proposition, which is the main ingredient in the proof of Theorem 2.
Proposition 9. Let be integers. Let be a prime power and an integer such that . For every integer ,
Proof of Proposition 9. Let . For every , pick a vector , independently and uniformly at random. Retain an -set if , and let be the -graph on whose edges are the retained sets. Note that the vectors are not required to be distinct or nonzero, and that depends on the choice of the vectors.
We also note that the random choice of the vectors is only needed to show that has many edges for some choice, whereas contains no copy of for every choice. We prove these two properties in the following two claims.
Claim 9.1. contains no copy of for every choice of the vectors.
Proof of Claim 9.1. Suppose otherwise, and let be such a copy, where , , and . Since , there is a subspace of dimension containing all vectors with . Let and let be the natural projection onto , given by for . The space has dimension two and thus contains nonzero vectors. Each nonzero vector of is contained in exactly one subspace of dimension one, namely its span, and each such subspace has nonzero vectors. Thus has subspaces of dimension one. We define a colouring of with these subspaces as follows. For each with , give the colour of the unique subspace containing . If , give any fixed colour. Since , the pigeonhole principle gives a set whose elements all have the same colour. Thus the vectors with are contained in for some nonzero . Since for every , we have for all . At the same time, since , the subspace has dimension . Thus , so the vectors with do not span , a contradiction, since . This proves Claim 9.1. ■
Claim 9.2. There exists a choice of the vectors such that .
Proof of Claim 9.2. Consider an -set . If is not retained, then all vectors with are contained in a subspace of dimension . We claim that there are such subspaces. Indeed, a linear map is given by , where , and its kernel is the subspace . If is nonzero, then has dimension , and conversely every subspace of dimension is the kernel of a nonzero linear map. There are such maps, and two have the same kernel exactly when one is a nonzero scalar multiple of the other. Thus each subspace is counted times, giving subspaces, and each of these subspaces contains vectors. Since the vectors are chosen independently and uniformly, the probability that all with are contained in any fixed one of these subspaces is . By the union bound,
where the last inequality uses . Thus, by linearity of expectation,
so some choice of the vectors gives at least this many edges. This proves Claim 9.2.
Together, Claims 9.1 and 9.2 prove Proposition 9.
Remark. For , the vector space has dimension , so the retained sets are exactly the linearly independent ones and Proposition 9 reduces to the construction of Ellis, Ivan and Leader, with the slightly weaker bound .
Proof of Theorem 2. Fix and let . Pick to be a power of two with . Then , , and . Proposition 9 therefore applies for every and . Letting and then , with , , and fixed, gives
which implies the claimed bound. □
An application to matroid basis hypergraphs
Our construction from § 2.1 also gives a bound for matroid basis hypergraphs. For a rank- matroid , its basis hypergraph is the -graph on the ground set of whose edges are the bases of . For a more detailed introduction to matroids and the standard terminology, we refer to Oxley [15]. Van der Pol, Walsh and Wigal [19] considered Turán problems for matroid basis hypergraphs and showed that the basis hypergraph of a rank- matroid contains if and only if the matroid has a -minor, see [19 Corollary 2.3]. Here, denotes the uniform matroid of rank on elements.
For integers and , let be the largest number of bases in a rank- matroid on elements containing no -minor, where if no such matroid exists. Following the notation of van der Pol, Walsh and Wigal [19], define
Both this limit and its limit as exist, see [19 Corollary 3.3]. For positive integers and with , van der Pol, Walsh and Wigal asked for the value of , see [19 Problem 1.1(iii)].
Motivated by their connection between daisies and matroid basis hypergraphs, we give an asymptotic answer to this question by showing that our construction from § 2.1 also yields matroids with many bases and no -minor. More specifically, we determine how fast approaches one as , up to a factor depending only on , for every fixed .
Proposition 10. For every fixed integer ,
as .
Proof of Proposition 10. Fix and , pick to be a power of two with as in the proof of Theorem 2, and let . By Claim 9.2, there are vectors for which the -graph on , whose edges are the -sets with , has at least edges. We first show that its edges are the bases of a matroid.
To this end, let and , and let . If , then for every . Otherwise, , since the vectors indexed by span and adding one vector can increase the dimension of a span by at most one. Since the vectors with span , there is some with . As for all and , we have . Again, . Thus is the set of bases of a rank- matroid .
By [19 Corollary 2.3], a rank- matroid contains a -minor if and only if its basis hypergraph contains . Since is -free by Claim 9.1, has no -minor, and thus
Letting and then , and using , gives . By the other direction of [19 Corollary 2.3], the basis hypergraph of a rank- matroid without a -minor is -free, so . The matching lower bound on now follows from , which in turn follows from the result of de Caen [5], as noted in the introduction. □
Hypergraph products
We now prove Theorem 5 and Proposition 8 in Sections 3.2 and 3.3, respectively. Before doing so, we give in Section 3.1 two lemmas on homomorphisms needed for these proofs.
Auxiliary results
The first of the two lemmas, Lemma 11, is the standard observation that the Turán density is monotone under homomorphisms, for which we give a short proof for completeness, and the second, Lemma 12, shows that the homomorphic edge number is multiplicative with respect to products.
Here and in the remainder of this note, we shall also need the notion of a blow-up of an -graph , which is obtained by replacing every vertex of by a set of vertices, called a part, and every edge of by all -sets meeting each of the corresponding parts in exactly one vertex. If every part has vertices, we denote the blow-up by .
Lemma 11. Let and be -graphs. If , then . Moreover, if and only if is -partite.
Proof of Lemma 11. A standard supersaturation result shows that (see, e.g., [14 Theorem 2.2]). If , then contains a copy of for , obtained by mapping vertices of with the same image to distinct vertices of the corresponding part. Thus . Moreover, if is -partite, then , and thus . If is not -partite, then complete -partite -graphs show that . □
Lemma 12. Let be an -graph and be an -graph. Then . In particular, for every integer .
Proof of Lemma 12. We first show that . To this end, let be a homomorphism from to an -graph with . By replacing with the subhypergraph consisting of the vertices and edges in the image of , we may assume that every edge of is the image of an edge of . Moreover, since and have no isolated vertices, every vertex of is contained in a common edge of with every vertex of , and is injective on every edge, so and are disjoint. Let be the -graph on with edge set , and let be the -graph on with edge set . Then and are homomorphic images of and , respectively, and thus and . Every edge of is of the form with and , and conversely every such set is an edge of , as is a homomorphism. Since and are disjoint, the set determines both and . Thus
For the other direction, let and be homomorphic images of and on disjoint vertex sets with and edges, respectively. Then the two homomorphisms together give a homomorphism from to , which has edges. Finally, the statement for follows by induction on .
Proof of Theorem 5
Since the idea behind the proof is easily lost among the technicalities and the parameters involved, we first sketch the argument before giving the details.
Proof sketch. Note that a blow-up of an -graph on vertices with sufficiently large parts contains a copy of if and only if . Moreover, if the parts have sizes as equal as possible, the density of the blow-up is close to that of , since a random -set meets some part twice with probability only about . It therefore suffices to find a dense -graph on vertices, where is independent of , such that there is no homomorphism from to . To this end, we consider and delete each edge independently with probability , chosen later. A fixed homomorphism survives the deletion only if no edge of its image is deleted. By Lemma 12, its image has at least edges, so it survives with probability at most . Note that the exponent in this bound is the homomorphic edge number of and not its number of edges, since several edges of a copy of in the blow-up may correspond to the same edge of , see Figure 1 for an example.

Figure 1. The construction for , and with five parts. The five edges of the copy of correspond to only the three edges of the triangle , a smallest homomorphic image of , so deleting from destroys the copy.
There are only maps from to , a number which is crucially independent of . The union bound therefore shows that, with positive probability, no homomorphism survives provided that . We therefore choose slightly larger than . The two losses, from the deletion and from the blow-up, are balanced by , and both are then of order up to constants depending only on . For powers, our construction is tight up to a polynomial factor in , since the homomorphic edge number is multiplicative by Lemma 12. Indeed, a smallest homomorphic image of has edges, and averaging over such an image gives the matching lower bound. We now give the formal proof.
Proof of Theorem 5. Let be a fixed -graph and let . If is -partite, then is -partite, and thus by Lemma 11. Suppose now that is not -partite, in which case .
We begin with the lower bound . Let be a homomorphism from to an -graph with . The map that applies in each of the factors is a homomorphism , so by Lemma 11. Note that . Let be an -free -graph on vertices, and pick an injective map uniformly at random. For every , the set is a uniformly random -subset of , so with probability . Since is -free, we have that for every choice of at least one satisfies , so the expected number of such edges is at least one, that is,
Hence for every , and letting gives , as claimed.
We next show that , following the construction sketched above. Fix and let and
We shall prove that , which implies the claimed bound. If or , this holds trivially, as the right-hand side is then larger than one, so we may assume that and . Let and partition into parts , each of size or . Let be the complete -partite -graph on , that is, the -graph whose edges are the -sets meeting distinct parts. For an edge of the complete -graph on , let be the set of edges of having exactly one vertex in for every . Then is the disjoint union of the sets over all edges of , and we have
where the -term tends to zero as and we used that . Now delete each edge of independently with probability , and let be the -graph on whose edge set is the union of the sets over all edges of that were not deleted. In other words, if denotes the -graph on given by the edges that were not deleted, then is the blow-up of with parts . Let be the event that every homomorphism has at least one edge for which the edge of was deleted. We claim that, if occurs, then is -free. Indeed, consider a copy of in and map every vertex of to the index of the part containing its image in the copy. Every edge of the copy is an edge of and thus meets distinct parts, so this map is a homomorphism , and the edge of the copy corresponding to is contained in . Since it is an edge of , the edge of was not deleted. As this holds for every , the event does not occur, a contradiction.
We next show that . To this end, fix a homomorphism . The -graph on with edge set is a homomorphic image of and thus has at least edges by Lemma 12. The edges of are deleted independently and thus the probability that none of the edges of this image is deleted is at most . Since there are at most maps from to , the union bound and the choice of give .
Each edge of is kept with probability , so . Let denote the indicator of the event , i.e., equals if occurs and zero otherwise. Since , , and , we have
Together with (1), this gives
Since and is zero whenever does not occur, there is a choice of deleted edges of for which occurs and is at least the right-hand side of this inequality. For this choice, is -free. Letting gives
as claimed.
Remark. The proof above gives, for all integers and , the upper bound
where, as in the proof, . The choice was only used to balance the first two terms.
Proof of Proposition 8
The idea of the proof is to first replace by a smallest homomorphic image , which does not decrease the Turán density of the product, and then to map the vertices of injectively and at random into an -free -graph of maximum size. The common link of the images of the edges of , that is, the -graph of all -sets whose union with each of these images is an edge, is then -free, and a straightforward averaging argument yields the claimed bound.
Proof of Proposition 8. Since , it suffices to show that .
Let be a homomorphism from to an -graph with , where and are disjoint. The map on with for and for is a homomorphism from to , as it maps every edge of to the edge of . Hence by Lemma 11, and it suffices to show that .
Let be an -free -graph on vertices with , and let denote its edge density, so . Choose now an injective map uniformly at random and let . Let be the -graph on whose edges are the sets such that is an edge of for every . In other words, is the common link in of the sets , where . Since any copy of in , together with , forms a copy of in , the -graph is -free, and thus .
After choosing , we pick uniformly at random from , so for every fixed , the set is chosen uniformly at random from . Indeed, every possible pair is equally likely. For a fixed , the pairs satisfying are obtained by choosing an -set , a bijection from to , and an injection from to , after which . Note that the number of such pairs does not depend on . Thus is not an edge of with probability . By the definition of , we have that exactly when for some . Hence the union bound gives
Since for every choice of , it follows that
Dividing by and letting gives , and rearranging yields the claimed bound. □
Concluding remarks
In this note, we determined the order of for every fixed as , and we showed that the homomorphic edge number is a useful parameter for Turán problems on hypergraph products. In terms of this parameter, we determined the exponential rate at which tends to zero for every -graph that is not -partite and gave a lower bound on for arbitrary and . We now close this note with some remarks on the limitations of our results and suggest further questions.
Daisies. For every fixed , we have determined the order of as . The bound of Caen gives the lower bound , and taking in the proof of Theorem 2 as the largest prime with , rather than a power of two, gives the upper bound . Here, we use the prime number theorem, which gives for fixed as . It would be interesting to determine whether a leading constant exists and, if so, to determine its value.
Hypergraph powers. For non--partite , Theorem 5 determines the exponential rate of as . For , the lower bound is the standard averaging bound applied to a smallest homomorphic image of , while the upper bound contains an unspecified constant depending on . We also note that the lower bound can be sharpened by directly applying Proposition 8. Indeed, applying it to and using Lemma 12 gives for every , and the same inequality holds with equality for . Moreover, the bound of Sidorenko [20] (see also [21]), applied to a smallest homomorphic image of , gives , and thus
Since these refinements do not change the dependence on , we have opted to present the simpler lower bound in Theorem 5 to emphasize that its upper and lower bounds agree up to a factor of order . In any case, the bounds do not generally determine the exact value of for a fixed . We leave it as an open question whether the factor can be omitted, that is, whether as .
Products of two different factors. Proposition 8 only gives a lower bound on , and using the construction of § 3.2 does not in general determine . The following example shows, however, that is not determined by the Turán densities and the uniformities of the factors alone.
For , let be the -graph with three edges , , for disjoint -sets , and let be the disjoint union of and a -graph consisting of distinct -subsets of a -set. By a result of Frankl [10], . Moreover, a -free -graph on vertices has at most edges inside every -set, and averaging over all -sets gives . Since the Turán density of a vertex-disjoint union of two hypergraphs is the maximum of their Turán densities, we obtain . On the other hand, and , since in both and every two vertices are contained in a common edge. Proposition 8 therefore gives , while (2), with , and , gives , so as . Hence, if were determined by , and the uniformities of and , then and would be equal, since and are -graphs with Turán density . However, , while for all sufficiently large , and this difference is explained by the homomorphic edge numbers of and .
Ramsey numbers of daisies and hypergraph products. For an -graph and an integer , let be the least such that every -colouring of contains a monochromatic copy of . Pudlák, Rödl and Sales [17] studied Ramsey numbers of daisies and obtained bounds for both fixed and unbounded stem sizes. Analogously to Problems 3 and 4, they also asked how compares to and , and, more specifically, how grows as a function of and , see [17 Problems 7.4 and 7.5]. Perhaps our methods can also be used to obtain bounds for Ramsey numbers of daisies and more general hypergraph products.
AI declaration. Theorem 2 grew out of the author’s earlier joint work with Axenovich on Turán densities of subgraphs of the hypercube, see [2 Proposition 2.5], where ideas from the construction of Ellis, Ivan and Leader [6] were used independently of any application to daisies. Based on this, the author suggested to GPT-6 Astra the specific modification of the construction presented in the proof of Theorem 2. A subsequent brief iterative exchange, guided by the author, ultimately led to a proof of the theorem. For Theorem 5 and Proposition 8, GPT-6 Astra was used to help work out technical details of the proofs. In both cases, all arguments in which GPT-6 Astra assisted were checked, shortened and reworked by the author. GPT-6 Astra was also used to assist with the literature search on Turán problems for hypergraphs. Finally, the note was written by the author, with GPT-6 Astra used to find typos and misprints, and occasionally to check grammar.
References
- [1]N. Alon. Erasure list-decodable codes and Turán hypercube problems. Finite Fields and Their Applications 100 (2024), Paper No. 102513.DOI
- [2]M. Axenovich and M. Pejić. On high-girth layered graphs of large Turán density in a hypercube. arXiv:2608.30544 (2026).arxiv.org/abs/2608.30544
- [3]B. Bollobás, I. Leader and C. Malvenuto. Daisies and other Turán problems. Combinatorics, Probability and Computing 20 (2011), no. 5, 743–747.
- [4]X. Cheng, D. Gerbner, H. Hama Karim and J. Zhou. On Turán problems for suspension hypergraphs. Discrete Mathematics 349 (2026), Paper No. 114887.arxiv.org/abs/2502.10905
- [5]D. de Caen. Extension of a theorem of Moon and Moser on complete subgraphs. Ars Combinatoria 16 (1983), 5–10.
- [6]D. Ellis, M.-R. Ivan and I. Leader. Turán densities for daisies and hypercubes. Bulletin of the London Mathematical Society 56 (2024), no. 12, 3838–3853.DOI
- [7]D. Ellis, M.-R. Ivan and I. Leader. Turán densities for small hypercubes. SIAM Journal on Discrete Mathematics 39 (2025), no. 2, 1363–1371.DOI
- [8]E. Emtander. Betti numbers of hypergraphs. Communications in Algebra 37 (2009), no. 5, 1545–1571.arxiv.org/abs/0711.3368
- [9]V. Falgas-Ravry and E. R. Vaughan. Applications of the semi-definite method to the Turán density problem for 3-graphs. Combinatorics, Probability and Computing 22 (2013), no. 1, 21–54.
- [10]P. Frankl. Asymptotic solution of a Turán-type problem. Graphs and Combinatorics 6 (1990), no. 3, 223–227.DOI
- [11]A. Grebennikov and J. P. Marciano. C₁₀ has positive Turán density in the hypercube. Journal of Graph Theory 109 (2025), no. 1, 31–34.DOI
- [12]C. Grosu. On the algebraic and topological structure of the set of Turán densities. Journal of Combinatorial Theory, Series B 118 (2016), 137–185.DOI
- [13]J. Hou, X. Hou, X. Liu, J. Zeng and Y. Zhang. A note on the t-partite link problem of Füredi. arXiv:2605.11049 (2026).arxiv.org/abs/2605.11049
- [14]P. Keevash. Hypergraph Turán problems. Surveys in Combinatorics 2011, London Mathematical Society Lecture Note Series 392 (2011), 83–140.DOI
- [15]J. Oxley. Matroid theory. Oxford Graduate Texts in Mathematics 21, Oxford University Press, Oxford, second edition, 2011.
- [16]M. Pejić. On the Turán density of C₁₀ in the hypercube. arXiv:2608.12237v2 (2026).
- [17]P. Pudlák, V. Rödl and M. Sales. On the Ramsey numbers of daisies I. Combinatorics, Probability and Computing 33 (2024), no. 6, 795–806.DOI
- [18]O. Pikhurko, J. Yang and X. Zhu. Turán densities of hypergraph augmentations. arXiv:2610.11757 (2026).
- [19]J. van der Pol, Z. Walsh and M. C. Wigal. Turán densities for matroid basis hypergraphs. arXiv:2502.03673 (2025).arxiv.org/abs/2502.03673
- [20]A. F. Sidorenko. Extremal combinatorial problems in spaces with continuous measure. Issled. Operatsii i ASU 34 (1989), 34–40 (in Russian).
- [21]A. F. Sidorenko. An analytic approach to extremal problems for graphs and hypergraphs. Extremal Problems for Finite Sets (Visegrád, 1991), Bolyai Society Mathematical Studies 3 (1994), 423–455.
- [22]P. Turán. On an extremal problem in graph theory (in Hungarian). Mat. Fiz. Lapok 48 (1941), 436–452.