Triangle-degrees in graphs and tetrahedron coverings in 3-graphs

We investigate a covering problem in $3$-uniform hypergraphs ($3$-graphs): given a $3$-graph $F$, what is $c_1(n,F)$, the least integer $d$ such that if $G$ is an $n$-vertex $3$-graph with minimum vertex degree $\delta_1(G)>d$ then every vertex of $G$ is contained in a copy of $F$ in $G$ ? We asymptotically determine $c_1(n,F)$ when $F$ is the generalised triangle $K_4^{(3)-}$, and we give close to optimal bounds in the case where $F$ is the tetrahedron $K_4^{(3)}$ (the complete $3$-graph on $4$ vertices). This latter problem turns out to be a special instance of the following problem for graphs: given an $n$-vertex graph $G$ with $m>n^2/4$ edges, what is the largest $t$ such that some vertex in $G$ must be contained in $t$ triangles? We give upper bound constructions for this problem that we conjecture are asymptotically tight. We prove our conjecture for tripartite graphs, and use flag algebra computations to give some evidence of its truth in the general case.


Introduction
Let F be a graph with at least one edge. What is the maximum number of edges ex(n, F ) an nvertex graph can have if it does not contain a copy of F as a subgraph? This is a classical question in extremal graph theory. If F is a complete graph, then the exact answer is given by Turán's theorem [63], one of the cornerstones of extremal graph theory. For other graphs F , the value of ex(n, F ) is determined up to a o(n 2 ) error term by the celebrated Erdős-Stone theorem [17].
Ever since Turán's foundational result, there has been significant interest in obtaining similar "Turán-type" results for r-uniform hypergraphs (r-graphs), with r ≥ 3. The extremal theory of hypergraphs has however turned out to be much harder, and even the fundamental question of determining the maximum number of edges in a 3-graph with no copy of the tetrahedron K  [3,4,12,20,24], as well as the surveys by Füredi [23], Sidorenko [61], and Keevash [34].
It is well-known that the Turán problem for an r-graph F is essentially equivalent to identifying the minimum vertex-degree required to guarantee the existence of a copy of F . More recently [11,44,51], there has been interest in variants where one considers what minimum i-degree condition is required to guarantee the existence of a copy of F . Given an i-set S ⊆ V (G) with i ≤ r, its neighbourhood in G is the collection Γ(S) = Γ G (S) := {T ⊆ V (G) \ S : S ∪ T ∈ E(G)} of (r − i)-sets T whose union with S makes an edge of G. The neighbourhood of S defines an (r − i)-graph G S := (V (G) \ S, Γ G (S)) , which is called the link graph of S. The degree of S in G is the size deg G (S) = deg(S) := |Γ(S)| of its neighbourhood. The minimum i-degree δ i (G) of G is the minimum of deg(S) over all i-subsets S ⊆ V (G). In particular, the case i = r − 1 has received particular attention; δ r−1 (G) is known as the minimum codegree of G, and a minimum codegree condition is the strongest single degree condition one can impose on an r-graph. Determining what minimum codegree forces the existence of a copy of a fixed r-graph F is known as the codegree density problem [51]. A few results on the codegree density for various small 3-graphs are known, see [18,19,36,49].
In a different direction, there has been significant recent research activity devoted to generalising another foundational result in extremal graph theory. Let F be a graph whose order divides n. What minimum degree condition is required to guarantee that a graph on n vertices contains an F -tilinga collection of n/v(F ) vertex-disjoint copies of F ? In the case of complete graphs, this was answered by the celebrated Hajnal-Szemerédi theorem [27], which (under the guise of equitable colourings) has applications to scheduling problems. For a general graph F , the Kühn-Osthus theorem [40] determines the minimum degree-threshold for F -tilings up to a constant additive error.
There has been a growing interest in determining analogous tiling thresholds in r-graphs for r ≥ 3, see the surveys by Rödl and Ruciński [59], and Zhao [64] devoted to the subject. In an effort to generalise Dirac's theorem on Hamilton cycles to hypergraphs, Rödl, Ruciński and Szemerédi [60] determined the minimum codegree threshold for the existence of a perfect matching in r-graphs for r ≥ 3. The paper also introduced the hugely influential absorption method, which has been used as a key ingredient in many of the results in the area obtained since. Beyond perfect matchings, codegree tiling thresholds have by now been determined for a number of small 3-graphs, including K  [30,43], and K with two edges removed) [10,39]. In addition, the codegree tiling thresholds for r-partite r-graphs have been studied recently [9,25,26,29,52] Turning to minimum vertex-degree tiling thresholds, fewer results are known. The vertex-degree thresholds for perfect matchings were determined for 3-graphs by Han, Person, and Schacht [28] (asymptotically) and by Kühn, Osthus and Treglown [41] and Khan [38] (exactly). Han and Zhao [32] determined the vertex-degree tiling threshold for K , while Han, Zang, andZhao [31] asymptotically determined the vertex-degree tiling threshold for all complete 3-partite 3-graphs.
As a key part of their argument, Han, Zang, and Zhao considered a certain 3-graph covering problem and showed it was distinct from the corresponding Turán-type existence problem. This stands in contrast with the situation for ordinary graphs, where existence and covering thresholds essentially coincide. Given an r-graph F , Falgas-Ravry and Zhao [21] introduced the notion of an F -covering, which is intermediate between that of the existence of a single copy of F and the existence of an F -tiling.
We say that an r-graph G has an F -covering if every vertex in G is contained in a copy of F in G. Equivalently an F -covering of G is a collection C of copies F whose union covers all of V (G).
For every positive integer i ≤ r − 1, the i-degree F -covering threshold is the function (1.1) We further let the i-degree F -covering density to be the limit † denote the complete r-graph on t vertices and K (r)− t denote the r-graph obtained by removing one edge from K (r) is an r-graph with a cyclic ordering of its t vertices such that every r consecutive vertices under this ordering form an edge. Falgas-Ravry and Zhao [21] , and C t ) for all r ≥ 3 and t > 2r 2 . In this paper we investigate c 1 (n, F ) and c 1 (F ) for various 3-graphs F . We first consider K Observe that for fixed n, f n (d) is a decreasing function of d over the interval [1, n − 2]. On the other hand (n−1) 2 d is an increasing function of d, so there exists a unique d = d (n) such that The upper and lower bounds on c 1 (n, F ) in Theorem 1.1 are apart by less than n/2. However it seems much more work will be needed to determine c 1 (n, F ) exactly. As a first step in this direction, we prove the following stability theorem characterising near-extremal configurations. Let c = √ 13−1 6 . Theorem 1.2. For every ε > 0, there exists δ > 0 and n 0 ∈ N such that the following holds: for every n ≥ n 0 , if H is a 3-graph on n + 1 vertices with minimum vertex degree at least (c − δ) n 2 2 and x ∈ V (H) is not covered by a copy of K The upper bound was derived from the flag algebra method. We believe that the lower bound is tight. As we show in Section 2.3, the problem of determining c 1 (K 4 ) is equivalent to (a special case of) a problem about triangle-degrees in graphs.
Given a graph G, the triangle-degree of a vertex x ∈ V (G) is the number of triangles that contains x. The well-studied Rademacher-Turán problem concerns the smallest average triangle-degree among all graphs with a given edge density (the edge density ρ(G) is defined as e(G)/ v(G)

2
). This problem attracted significant attention (see [5,14,22,46,47]) until it was resolved asymptotically by Razborov [56] using the framework of his newly-developed theory of flag algebras. Different proofs expressed in the language of weighted graphs were later found by Nikiforov [53] and by Reiher [58] (who generalised Razborov's result to cliques of order 4 and of arbitrary order t, respectively).
Let t max (G) denote the maximum triangle-degree in G. (This is related to but different from the well-studied book number, which is the maximum number of triangles containing a fixed edge of G, see the discussion in Section 4 for details.) For ρ ∈ [0, 1], we define which is the asymptotically smallest maximum scaled triangle-degree in a graph with edge density ρ.
We derive the following upper bounds for τ (ρ) and conjecture that they are tight. If Conjecture 1.5 holds, then c 1 (K As we will see, the constructions underpinning Theorem 1.4 are very different from the extremal ones for the Rademacher-Turán problem. We use flag algebra computations to show the upper bounds from Conjecture 1.5 are not far from optimal when ρ ∈ [ 1 2 , 2 3 ] (see Theorem 3.8). Following on a beautiful result of Bondy, Shen, Thomassé and Thomassen [7] on a tripartite version of Mantel's theorem, Baber, Johnson and Talbot [2] gave a tripartite analogue of Razborov's triangle-density result. In a similar spirit, we prove Conjecture 1.5 holds for tripartite graphs. Note that a tripartite graph on n vertices can have between 0 and n 2 3 edges. Theorem 1.6. Let G be a tripartite graph on n vertices. Then

Structure of the paper
In Section 2 we prove Theorems 1.1-1.3 along with bounds for c 1 (C 5 ) and c 1 (K t ) for t ≥ 5. In Section 3 we prove Theorems 1.4 and 1.6, and give flag algebra bounds on τ (ρ). We end the paper in Section 4 with a discussion of book numbers in graphs and a comparison of known results and conjectures on minimal triangle density, triangle-degree and book-number as functions of edge density.

Notation
We use standard graph and hypergraph theory notation throughout the paper. In addition, we use [n] to denote the set {1, 2, . . . n} and S (r) to denote the collection of all r-subsets of a set S. Where there is no risk of confusion, we identify hypergraphs with their edge-sets. is the (unique up to isomorphism) 3-graph on 4-vertices spanning 3 edges, also known as the generalised triangle. In this subsection, we prove Theorem 1.1.
Proof of Theorem 1.1. Lower bound: let n be odd, and let d = d ≤ (n − 1)/2. We construct a 3-graph H on n vertices as follows. Set aside a vertex v , and let A B be a bipartition of V (H) \ {v } into two sets of equal size. Let G be an arbitrary d-regular bipartite graph with partition A B. Now let H be the 3-graph whose 3-edges are the union of the triples {v xy : xy ∈ E(G)} together with all the triples of vertices from A ∪ B inducing at most one edge in G.
Clearly, for every triple of vertices S ⊆ A ∪ B, S ∪ {v } induces at most two edges of H and v is not contained in any copy of K By symmetry, the degree of any vertex in B is also f n (d). Thus Upper bound: suppose H is a 3-graph on n vertices with δ 1 (H) = n−1 2 d and no copy of K covering a vertex x (here n is not necessarily odd). We shall show that Counting non-edges of H over all v ∈ V \ {x}, we thus have v∈V \{x} where in the last line we used Jensen's inequality and our minimum degree assumption deg(x) ≥ n−1 Applying our minimum degree assumption deg

Proof of Theorem 1.2
Our proof shall make use of a consequence of Karamata's inequality. Let a n ≥ a n−1 ≥ . . . ≥ a 1 and b n ≥ b n−1 ≥ . . . ≥ b 1 be real numbers. We say that a = (a n , . . . , a 1 ) . ≤ a n be real numbers such that i a i =ān, and let η > 0.
Proof. Since η > 0, our assumption on i a i tells us that [n] \ B = ∅. If B = ∅, then the claimed inequality is just Jensen's inequality. So assume B is nonempty and set |B| = βn for some β > 0. Let a 1 , a 2 , . . . , a n be given by Observe that i a i = i a i =ān. Setting It follows readily from this that the n-tuple (a n , a n−1 , a n−2 , . . . , a 1 ) majorises (a n , a n−1 , a n−2 . . . , a 1 ). Applying Karamata's inequality to the convex function f we obtain Another ingredient in the proof of Theorem 1.2 is a classical result of Andrásfai, Erdős and Sós.
Theorem 2.2 (Andrásfai, Erdős, Sós [1]). Let G be a triangle-free graph on n vertices with minimum degree δ(G) > 2n 5 . Then G is bipartite. With these two preparatory results in hand, the proof of Theorem 1.2 is straightforward: we first use Lemma 2.1 to show that the overwhelming majority of vertices in the link graph H x have degree much larger than 2 5 n, whereupon we deduce from the Andrásfai-Erdős-Sós theorem that H x is almost bipartite.
. Suppose x is a vertex in H not covered by any copy of K  η)n} be the collection of vertices in H whose codegree with x is smaller than average by a multiplicative factor of (1 − η). Set |B| = βn.
Since x is not covered by a copy of K in H, the following hold: (ii) for every triple of vertices {y 1 , y 2 , y 3 } inducing two edges in H x , the 3-edge y 1 y 2 y 3 is missing from E(H).
Property (i) implies that for every y ∈ [n], the neighbourhood Γ(xy) is an independent set in H x , while property (ii) implies that for every z, z ∈ H xy and every w ∈ H xz , the 3-edges zz y and zwy are both missing from E(H). In particular for every y ∈ [n], we have Summing this inequality over all y ∈ [n] and using the fact y∈[n] z∈Hxy (|H xz |−1) = 2 y∈[n] |Hxy| 2 , we get Since the function f (t) = t 2 is convex and y∈[n] |H xy | = 2|H x | = cn 2 , we can apply Lemma 2.1 to bound below the right-hand side of (2.3) by Inserting this inequality back into (2.3), dividing through by n 3 and using c ≥ c − δ yields where the last inequality holds because our choice of δ in (2.2) ensures δ < c /6. Note that c satisfies 1 − c = 3c 2 . Rearranging terms in inequality (2.5) gives By the second part of (2.2) and the assumption that n is sufficiently large, we have and |B| = βn < εn. Remove from H x all vertices from B. By the definitions of δ, η, ε, the resulting triangle-free graph G has at most n vertices and minimum degree at least By Theorem 2.2, G is bipartite. Since we removed only at most εn vertices from H x to obtain G, it follows that H x can be made bipartite by removing at most εn 2 edges, as claimed. This concludes the proof of Theorem 1.2.

Proof of Theorem 1.3
Given an r-graph G, write t G (x) for the number of copies of K Proof. In one direction, let H be an r-graph on n+1 vertices with minimum degree α n−1 r−1 . Suppose v is not covered by any K H covering v . The minimum degree condition in H then implies that for every vertex x in the n-vertex (r − 1)-graph G, as desired. In the other direction, let G be an (r − 1)-graph on n vertices with at least α n−1 r−1 edges such We add a new vertex v to G and define an r-graph H on V (G) {v } by setting the link graph of v be equal to G, and adding in as edges all r-sets from V (G) (r) which do not induce a copy of K (r−1) r in G. This yields an r-graph on n + 1 vertices in which v is not covered by a copy of K (r) Corollary 2.4. For any r ∈ N, the 1-degree covering density  Thus c 1 (3n + 1, C 5 ) ≥ 5 9 3n 2 − 2n 3 , as desired. Upper bound: Mubayi and Rödl [50,Theorem 1.9] proved that π(C

K
Proof. Let ε > 0 and n be sufficiently large. Suppose that H is a 3-graph on n vertices with δ 1 (H) ≥ α n 2 2 for some α > 0 satisfying 1 + 2 α − 2 α 2 = c 1 (K On the other hand, for any y ∈ V , we have Note that . Thus provided αn = v(H ) is sufficiently large, there must be a set S ⊆ V such that S ∪ {z} induces a copy of K t+1 ), and hence (since ε > 0 was arbitrary) that c 1 (K . Proposition 2.7. Suppose there exists a 3-graph H on [N ] such that (i) every vertex of H has degree at most d; (ii) every t-set of vertices from V (H) spans at least one edge.
Then we have Proof. We construct a 3-graph G on [N n + 1] as follows. Set aside v = N n + 1, and partition the remaining vertices into n-sets V 1 , V 2 , . . . V N . Now let the link graph of v in G be the complete N -partite graph on [N n] with partition N i=1 V i . To make up the remainder of the edges of G, add in all triples v 1 v 2 v 3 from [N n] (3) with v j ∈ V i j for j = 1, 2, 3 and and the Fano plane S 7 respectively, which give α 3 = 2, α 7 = 4. The affine plane of order 9, S 9 , is the unique up to isomorphism STS of order 9 and has α(S 9 ) = α 9 = 4. It is further known that α 13 = 6, α 15 = 6 [48], and α 19 = 7 [8] (see also the monograph of Kaski and Ostergård [33]).
Remark 2.9. The lower bounds on the covering densities in Proposition 2.8 above are strictly stronger than the bounds one gets from the conjectured values of the corresponding Turán densities.
In each case, they are about 5 × 10 −2 below our upper bounds. Note that if one applies Proposition 2.7 to the unique STS on 3-vertices, one gets a lower bound of 2/3 for c 1 (K (3) 4 ). We obtained an improvement of this bound in Theorem 1.3 by almost 5 × 10 −2 by adding a few edges in the link graph of v and deleting a few triples meetings the corresponding pairs. It seems natural to believe a similar (albeit significantly more intricate) process would similarly improve the lower bounds in Proposition 2.8. If we had to guess, we would thus say that the true value of c 1 (K (3) t ) for t = 6, 8,9 probably lies closer to the upper bounds we give.
For completeness, we give (very weak) bounds on c 1 K

Proof.
Lower bound: consider a partition of [2n] into n-sets, [2n] = V 1 V 2 . Let G be the 3-graph on [2n] whose edge-set consists of all triples meeting both V 1 and V 2 . It is easily checked that G is K

Triangle-degree in graphs
In this section, we investigate the problem of minimising the maximum triangle-degree τ (ρ)n 2 /2 in a 2-graph with a given edge density ρ. We give upper bound constructions for τ (ρ), which we conjecture are best possible. We show our conjecture holds for tripartite graphs and use flag algebra computations to bound below τ (ρ) for general graphs with 1/2 < ρ ≤ 2/3.
. In particular, this implies that τ (ρ) ≤ 1 − ρ. If Conjecture 1.5 is true, then since 19 upper bound on ρ), which is less than n/(2r) (so one could take H i to b a balanced bipartite graph, for example). The resulting graph is ρnregular. We denote by G u ρ,n the family of all graphs that can be constructed in this way.

Construction 3.3 (Upper interval construction).
Let ρ ∈ [ r r+1 − 1 3r(r+1) , r r+1 ] for some r ∈ N. Suppose n ∈ N is divisible by 2(r + 1). Consider a balanced complete (r + 1)-partite graph on [n] with parts V 1 , . . . V r+1 . Equally divide each V i into V i and V i . Let φ : [r + 1] → [r + 1] be any bijection with the property that φ(i) = i for all i ∈ [r + 1] (any permutation of [r + 1] with no fixed point will do). Now for every i ∈ [r + 1], replace the complete bipartite graph between V i and V φ(i) by an arbitrary d-regular bipartite subgraph H i , where d = ρ − r r+1 + 1 2(r+1) n . The resulting graph is ρn -regular. We denote by G d ρ,n the family of all graphs that can be constructed in this way.
Remark 3.4. The choices of the graphs H i in both Construction 3.2 and 3.3 give rise to very different graphs (lying at edit distance Ω(n 2 ) from each other). In particular if Conjecture 1.5 is correct, then the problem of minimising the maximum triangle-degree is not stable. This stands in some contrast with the Rademacher-Turán problem for triangles, for which Pikhurko and Razborov [54] obtained a stability result, establishing that there is an asymptotically unique way of minimising the number of triangles for a given edge-density. This instability is observed even at the level of subgraph frequencies, as e.g. in the first construction we could take as H i a subgraph of a blow-up of the five-cycle instead of a bipartite graph, provided ρ ≤ r−1 r + 2 5r . In particular, this suggests Conjecture 1.5 may be harder to resolve than the Rademacher-Turán problem for triangles, and might not amenable to standard flag algebraic approaches due to the instability of the extremal examples.
Proof of Theorem 1.4. Assume that ρ ∈ [ r−1 r , r r+1 ] for some r ∈ N. When r = 1, a ρn-regular bipartite graph on n vertices (we may use G u ρ,n and G d ρ,n as well) shows that τ (ρ) = 0. So we may assume that r ≥ 2.
First assume that ρ ∈ [ r−1 r , r r+1 − 1 3r(r+1) ]. Consider an arbitrary graph G of G u ρ,n , for some n divisible by 2r. Pick a vertex x ∈ V i . Let us compute the triangle-degree of x. There are at most (n − |V i |)d pairs (y, x ) with x ∈ V i \ {x}, y ∈ [n] \ V i and xx y forming a triangle in G. Further, there are at most 1 2 j =i |V j |d pairs (y, y ) with y, y ∈ V j = V i and xyy forming a triangle in G. Finally, there are at most 1 2 j: j =i k: k =i,j |V j ||V k | pairs (y, z) with y ∈ V j , z ∈ V k , V i , V j , V k all distinct and xyz forming a triangle in G. Since each part V i is triangle-free by construction, there are no other triangles in G containing x, and the triangle-degree of x is thus at most This gives the claimed upper bound on τ (ρ) for ρ ∈ [ r−1 r , r r+1 − 1 3r(r+1) ]. Next, assume that ρ ∈ [ r r+1 − 1 3r(r+1) , r r+1 ]. Consider an arbitrary graph G of G d ρ,n , for some n divisible by 2(r + 1). Pick a vertex x ∈ V i (the case when x ∈ V i is analogous) . When computing the triangle-degree of x, it is more convenient to count the number of triangles containing x in the balanced complete (r + 1)-partite graph from which an edge was deleted when constructing G. Observe that every triangle has lost at most one edge.
First of all, we have lost (|V φ(i) | − d) r−1 r+1 n triangles of the form xyz with y ∈ V φ(i) . Secondly, It is an easy exercise in calculus to show that as a function of x ∈ (0, 1), the right-hand side is maximized at x = 2−2s 4−3s ≤ 1 3 (as s ≥ 2 3 ), and is decreasing in [x , +∞). Under our assumption x ≥ 1/3, we thus have .
This implies that t max (G) ≥ e(G) − 2 9 n 2 . Case 2: 0 < s < 2 3 . By inequalities (3.1) and (3.3) we have , 1], then both terms on the right-hand side are non-positive. Assume now that x ∈ [ 1 3 , 3 7 ). Then for such values of x, the right-hand side is an increasing function of s. Applying our assumption on s, its value is at most The discriminant of this quadratic is 4 9 − 4 · 1 8 · 11 12 = − 1 72 < 0, so the expression above is (strictly) non-positive. We deduce that the right-hand side of (3.4) is non-positive for every value of x ∈ [0, 1]. This yields t max (G) ≥ 3 2 e(G) − 1 4 n 2 .

Flag algebra bounds
In this section we will employ Razborov's [55] flag algebra framework, and more specifically his semidefinite method, to obtain bounds for some of the problems we study. The semi-definite method has become a fairly standard tool in extremal combinatorics -see e.g. [57] for a survey of some of the early applications. As the method is well established and we have only obtained non-sharp bounds using it, we give only minimal details here, without expounding on the underlying theoretical machinery.
We have used Flagmatic to perform our flag algebra computations; this is an open source program written by Emil Vaughan, and later developed further by Jakub Sliacan [62], who currently maintains a Flagmatic page on GitHub [62]. We have used Vaughan's Flagmatic 2.0 in this paper. We refer the reader to [20] and to the Flagmatic 2.0 section on the webpage [62] for a description of the inner workings of Flagmatic and download links for the program. Our calculations involve the use of flag inequalities given as 'axioms'. The use of such 'axioms' first appeared in [18], where an edge-maximisation problem was solved subject to a codegree constraint. We refer a reader interested in the details to either Section 3 in that paper or to the Flagmatic 2.0 webpage [62].
Let  Note the constraint we have given corresponds to requiring that all but o(1) proportion of the vertices have triangle-degree at most y n 2 2 + o(n) (which is slightly weaker than what we require for τ ). A standard flag algebra computation will give us an upper bound ε I > 0 on the solution to Problem 3.7. If f (x) = ax + b over the interval I, then this tells us that f (x − ε I ) = a(x − ε I ) + b is a lower bound for τ (x) on the interval I − ε I := {x ∈ I : x ≤ sup I − ε I }, i.e that f (ρ) is a most aε I away from the true value of τ (ρ) on I − ε. Using this technique, we obtain the following: The theorem follows from standard algebra computations using the method outline above. Running the script theorem38.sage which is found in the auxiliary files of this ArXiv submission on Flagmatic 2.0 yields the bounds claimed above. (The resulting computation certificates are somewhat large, but the computation itself can easily be run on a modern laptop computer.) We also 'zoom in' on the value ρ = ρ at which τ (ρ) becomes greater than 1 − ρ, and which we conjecture is equal to 19 27 . This is done by giving an upper bound for the following variant of Problem 3.7: Problem 3.9. Maximise 1 − x − ρ subject to the constraint T 1 ≤ x.
Suppose for some fixed x we perform a flag algebra calculation and get a non-positive upper bound for the solution to Problem 3.9 . This implies that any n-vertex graph with at least (1 − x) n 2 2 + o(n 2 ) edges must have a positive proportion of its vertices having triangle-degree greater than x n 2 2 + o(n 2 ). In particular we must have ρ ≤ x. Using this technique, we obtain the following bounds on ρ Proof. The theorem follows from standard algebra computations using the method outline above. Running the script theorem310.sage which is found in the auxiliary files of this ArXiv submission on Flagmatic 2.0 yields the bounds claimed above. (This is a much smaller computation than the one required for Theorem 3.8.)

Book numbers of graphs
In Section 3, we investigated the following question: let G be a graph on n vertices with m > ex(n, K 3 ) edges. What is the largest t such that G must have some vertex contained in at least t triangles? A different but equally natural question is to ask: what is the largest b such that G must have some edge contained in at least b triangles? This is in fact a well-studied problem in graph theory. The study of book numbers in graphs was initiated by Erdős in 1962 [14], and has attracted considerable attention in extremal graph theory and Ramsey theory. Set Erdős conjectured that β(n, ex(n, K 3 ) + 1) > n 6 . This was proved by Edwards [13] and independently by Khadžiivanov-Nikiforov [37]. Bollobás and Nikiforov [6] determined β(n, m) exactly for infinitely many value of m with n 2 4 < m < n 2 3 . A construction giving the best known lower bound on β(n, m) was given by Erdős, Faudree and Györi [15], generalising an earlier construction due to Erdős, Faudree and Rousseau [16].
We believe that the minimum degree condition in Conjecture 4.3 can be replaced by a size condition, and this belief seemed to be borne out by flag algebra computations we ran for this problem.
Conjecture 4.4. Let x ∈ Q ∩ ( 1 2 , 1) and b(x) be as above. Then β(x) = b(x), i.e. any graph on n vertices with at least x n 2 2 edges has book number at least b(x)n.

Maximal triangle-degree, book number and triangle density
In Sections 3 and 4.1, we discussed the maximum triangle-degree of a vertex and the book number (i.e. maximum triangle-degree of an edge) in graphs, giving conjectures on their minimum value for a given edge-density or minimum degree condition. Here we compare the conjectured behaviour of these two triangle-related extremal quantities with each other and with the minimal triangle density in graphs G with ρ n 2 edges for 1 2 ≤ ρ ≤ 2 3 . Razborov [56] showed that such a graph G contain at least κ(ρ) n 3 + o(n 3 ) triangles, where κ(ρ) = 1 6 1 − 2(2 − 3ρ) 2 + 2(2 − 3ρ) 2 .
Finally, let β (x) denote the function obtained by extending the function b(x) from Conjecture 4.3 from the rationals in ( 1 2 , 2 3 ] to a monotonically increasing left-continuous function on the whole interval. This last function unfortunately does not have a nice closed form, but we can plot an approximation of it (or rather: ρβ (ρ)) along the other three in Figure 1, allowing for a visual comparison of the four functions κ, λ, τ and ρβ in the interval ρ ∈ ( 1 2 , 2 3 ]. Clearly by averaging we have that κ(ρ) is the smallest of the functions in Figure 1. Assume now that Conjecture 1.5 is true. Then Constructions 3.2 and 3.3 provide ρn-regular graphs G of order n with t max (G) = τ (ρ)n 2 /2 + o(n). Averaging the triangle-degree over all vertices, this would give that λ(ρ) ≤ τ (ρ).