On the 3-Local Profiles of Graphs
|
|
- Virginia Fox
- 5 years ago
- Views:
Transcription
1 On the -Local Profiles of Graphs Hao Huang, Nati Linial, 2 Humberto Naves, Yuval Peled, 4 and Benny Sudakov 5,6 SCHOOL OF MATHEMATICS INSTITUTE FOR ADVANCED STUDY PRINCETON, NJ huanghao@math.ias.edu 2 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING THE HEBREW UNIVERSITY OF JERUSALEM JERUSALEM 9904, ISRAEL nati@cs.huji.ac.il DEPARTMENT OF MATHEMATICS UCLA, LOS ANGELES, CA hnaves@math.ucla.edu 4 SCHOOL OF COMPUTER SCIENCE AND ENGINEERING THE HEBREW UNIVERSITY OF JERUSALEM JERUSALEM 9904, ISRAEL yuvalp@cs.huji.ac.il 5 DEPARTMENT OF MATHEMATICS ETH, 8092 ZURICH, SWITZERLAND 6 DEPARTMENT OF MATHEMATICS UCLA, LOS ANGELES, CA bsudakov@math.ucla.edu Received November 4, 202; Revised July 28, 20 Contract grant sponsor: NSF; Contract grant number: DMS-2855; Contract grant sponsor: Israel Science Foundation; Contract grant sponsor: USA-Israel BSF grant; Contract grant sponsor: NSF; Contract grant number: DMS-085; Contract grant sponsor: AFOSR MURI; Contract grant number: FA ; Contract grant sponsor: USA-Israel BSF grant. Journal of Graph Theory C 20 Wiley Periodicals, Inc.
2 2 JOURNAL OF GRAPH THEORY Published online in Wiley Online Library (wileyonlinelibrary.com). DOI 0.002/jgt.2762 Abstract: For a graph G,letp i (G), i = 0,..., be the probability that three distinct random vertices span exactly i edges. We call (p 0 (G),..., p (G)) the -local profile of G. We investigate the set S R 4 of all vectors (p 0,..., p ) that are arbitrarily close to the -local profiles of arbitrarily large graphs. We give a full description of the projection of S to the (p 0, p ) plane. The upper envelope of this planar domain is obtained from cliques on a fraction of the vertex set and complements of such graphs. The lower envelope is Goodman s inequality p 0 + p. We also give a full description of the 4 triangle-free case, i.e. the intersection of S with the hyperplane p = 0. This planar domain is characterized by an SDP constraint that is derived from Razborov s flag algebra theory. C 20 Wiley Periodicals, Inc. J. Graph Theory 00:, 20 Keywords: local profiles; induced densities; flag algebras. INTRODUCTION For graphs H, G, we denote by d(h; G) the induced density of the graph H in the graph G. Namely, the probability that a random set of H vertices in G induces a copy of the graph H. Many important problems and theorems in graph theory can be formulated in the framework of graph densities. Most of the emphasis so far has been on edge counts, or equivalently, on maximizing d(k 2 ; G) subject to some restrictions. Thus Turán s theorem determines max d(k 2 ; G) under the assumption d(k s ; G) = 0 for some s. The theorem further says that the optimal graph is the complete balanced (s )- partite graph. This was substantially extended by Erdős and Stone [6] who determined max d(k 2 ; G) under the assumption that the H-density (not induced) of G is zero for some fixed graph H. Their theorem also shows that the answer depends only on the chromatic number of H. Ramsey s theorem shows that for any two integers r, s 2, every sufficiently large graph G has either d(k s, G) >0ord(K r, G) >0. The Kruskal Katona Theorem [5,6], can be stated as saying that d(k r ; G) = α implies that d(k s ; G) α s/r for r s. Finding min d(k s ; G) under the assumption d(k r ; G) = α turns out to be more difficult. The case r = 2 of this problem was solved only recently in a series of papers by Razborov [2], Nikiforov [7], and Reiher [2]. A closely related question is to minimize d(k s ; G) given that d(k r ; G) = α for some real α [0, ] and integers r, s 2. The case α = 0 of this problem was posed by Erdős more than 50 years ago. Although, recently Das et al. [], and independently Pikhurko [8], solved it for certain values of r and s it is still open in general. Numerous further questions concerning the numbers d(h; G) suggest themselves. Goodman [0] showed that min G d(k ; G) + d(k ; G) = /4 o(), and the random graph G(n, 2 ) shows that this bound is tight. Erdős [5] conjectured that a G(n, 2 ) graph also minimizes d(k r ; G) + d(k r ; G) for all r, but this was refuted by Thomason Journal of Graph Theory DOI 0.002/jgt
3 ON THE -LOCAL PROFILES OF GRAPHS [25] for all r 4. A simple consequence of Goodman s inequality is that min G max{d(k ; G), d(k ; G)} =/8. The analogous statement for r = 4 is not true as can be shown using an example of Franek and Rödl [8] (see [4] for the details). On the other hand, the max min version of this problem is now solved. As we have recently proved [4], max G min{d(k r ; G), d(k r ; G)} is obtained by a clique on a properly chosen fraction of the vertices. Closely related to these questions is the notion of inducibility of graphs, first introduced in [9]. The inducibility of a graph H is defined as lim n max G d(h; G), where the maximum is over all n-vertex graphs G. This natural parameter has been investigated for several types of graphs H. For example complete bipartite and multipartite graphs [,2], very small graphs [7, ] and blow-up graphs []. In light of this discussion, the following general concept suggests itself. Definition.. For a family of finite graphs H = (H,..., H t ), let d(h; G) := (d(h ; G),...d(H t ; G)). Define (H) to be the set of all p = (p,..., p t ) [0, ] t for which there exists a sequence of graphs G n, such that G n and d(h; G n ) p. We likewise define G (H) where we require that G n G, an infinite families of graphs of interest (e.g. K s -free graphs). The initial discussion suggests that it may be a very difficult task to fully describe (H) or G (H). Indeed, it was shown by Hatami and Norine [2] that in general it is undecidable to determine the linear inequalities that such sets satisfy. In this article, we solve two instances of this question. We denote by p i (G) the probability that three distinct random vertices in the graph G span exactly i edges. The first theorem describes the possible distributions of -cliques and -anticliques in graphs (i.e. of (p 0, p )). We have Goodman s inequality [0] as a lower bound, and an upper bound from [4]. We show that these bounds fully describe all possible (p 0, p ). Theorem.2. For p 0 [0, ], letβ be the unique root in [0, ] of β + β 2 ( β) = p 0. Then, (p 0, p ) (K, K ) if p 0 + p 4 and p max {( p 0 / ) + p0 / ( p 0 / ) 2,( β) }. The analogous question concerning (K r, K r ) for r > is widely open. While the analogous upper bound is proved in [4], the situation with respect to the lower bounds is still poorly understood [9, 24]. The second theorem in this article is proved using the theory of flag algebras [20]. This theory provides a method to derive upper bounds in asymptotic extremal graph theory. This is accomplished by generating certain semidefinite programs (=SDP) that pertain to the problem at hand. By passing to the dual SDP we derive necessary conditions for membership in (H) or G (H). Section 4 contains a self contained discussion, covering this perspective of the theory of flag algebras. The theorem below demonstrates the special role that bipartite graphs play in the study of triangle-free graphs. As the theorem shows, all -local profiles of trianglefree graphs are also realizable by bipartite graph. Moreover, the theory of flag algebras provides a complete answer to this question. This yields a different perspective to the fact that almost all triangle-free graphs are bipartite [4]. We denote the -vertex path by P and its complement by P. Also, as usual, A 0 means that the matrix A is positive Journal of Graph Theory DOI 0.002/jgt
4 4 JOURNAL OF GRAPH THEORY semidefinite (=PSD). The class of bipartite (resp. triangle free) graphs is denoted by BP (resp. TF). Theorem.. equivalent: For p 0, p, p 2 0 s.t. p 0 + p + p 2 =, the following conditions are I. (p 0, p, p 2 ) TF (K, P, P ) ( ) ( ) ( ) 0 0 II. p 0 + p + p III. (p 0, p, p 2 ) BP (K, P, P ) The remainder of this article is organized as following. In Section 2, we use random graphs to show the realizability of G (H). In Section, we prove Theorem.2. In Section 4, we use the theory of flag algebras to derive SDP constraints on membership in G (H). In Section 5, we prove Theorem.. We close with some concluding remarks and several open problems. 2. RANDOM CONSTRUCTIONS Let H = (H,..., H t ) be a collection of graphs, and p = (p,..., p t ) [0, ] t. In order to prove that p G (H), we need arbitrarily large graphs G for which d(h; G) p is negligible. We accomplish this using appropriately designed random G s. Let be a symmetric n n matrix with entries in [0, ] and zeros along the diagonal. Corresponding to is a distribution G( ) on n-vertex graphs where ij is an edge with probability i, j and the choices are made independently for all n i > j. We say that a graph G is supported on if G is chosen from G( ) with positive probability. Lemma 2.. For every list of graphs H,..., H t there exists an integer N 0 such that if n > N 0 and is an n n matrix as above, then there exists an n-vertex graph G supported on such that i =,..., t d(h i; G ) E [d(h i ; G)] G G( ) n We note that the statement need not hold if G( ) is replaced by an arbitrary distribution on n-vertex graphs. Proof. Fix a graph H. Let us view an n-vertex graph G as a ( n 2) -dimensional binary vector. The mapping G d(h; G) has Lipschitz constant ( H ) ( 2 / n ) 2. We can therefore apply Azuma s inequality and conclude that [ ] ( Pr G G( ) d(h; G ) E [d(h; G)] G G( ) ( n ) 2exp 2) n 2n ( H ) 2. 2 Using the union bound and denoting h = max H i,weget Journal of Graph Theory DOI 0.002/jgt
5 [ Pr d(h; G ) E G G( ) ( ( n 2) 2t exp ON THE -LOCAL PROFILES OF GRAPHS 5 G G( ) [d(h; G)] ] n ) 2n ( ) h 2 = o n (). 2 This lemma is easily generalized for hypergraphs of greater uniformity.. DISTRIBUTION OF -CLIQUES AND -ANTICLIQUES In this section, we prove Theorem.2 and produce a full description of the set (K, K ). We state the known lower and upper bounds and show that they fully describe this set. Theorem. (Goodman [0]). For every n-vertex graph G p 0 (G) + p (G) ( ) 4 O. n Theorem.2 ([4]). Let r, s 2 be integers and suppose that d(k r ; G) α where G is an n-vertex graph and α 0.Letβ be the unique root of β r + rβ r ( β) = α in [0, ]. Then d(k s ; G) max {( α /r) s + sα /r ( α /r) s,( β) s } + o() Namely, given d(k r ; G), the maximum of d(k s ; G) is attained up to a negligible errorterm either by a clique on some subset of the n vertices, or by the complement of such a graph. In particular, for every G p (G) max {( p 0 (G) /) + p0 (G) /( p 0 (G) /) 2,( β) }, where β is the unique root of β + β 2 ( β) = p 0 (G) in [0, ]. Proof of Theorem.2. Let C,C 2 be the (p 0, p ) curves induced by cliques and complements of cliques, respectively. C ={(( x) + ( x) 2 x, x ) x [0, ]} C 2 ={(x,( x) + ( x) 2 x) x [0, ]} For i =, 2letB i [0, ] 2 be the region bounded by p 0 0, p 0, p 0 + p 4, and by C i. We need to prove that (K, K ) = B B 2. By Theorems. and.2 B B 2. We show that every point in this domain can be approximated arbitrarily well by (p 0 (G), p (G)) for arbitrarily large G. We define the following parameterized family of random graphs: Definition.. For every x, a, b, c [0, ], G x,a,b,c, is the class of random graphs (V, E), where V = A B with A =x V and B =( x) V. Adjacencies are chosen independently among pairs, with Journal of Graph Theory DOI 0.002/jgt
6 6 JOURNAL OF GRAPH THEORY FIGURE. The curves that bound the region of (K, K ), and the auxiliary curve C used in the proof. a Pr(ij E) = b c i, j A i, j B i A, j B or vice versa A simple computation shows that and Ep 0 (G x,a,b,c ) = x ( a) + ( x) ( b) + x 2 ( x)( a)( c) 2 + x( x) 2 ( b)( c) 2 + o() Ep (G x,a,b,c ) = x a + ( x) b + x 2 ( x)ac 2 + x( x) 2 bc 2 + o() By Lemma 2., (Ep 0 (G x,a,b,c ), Ep (G x,a,b,c )) (K, K ) for every (x, a, b, c) [0, ] 4. The following curve is used in the proof. Consider the following continuous map, C ={(t,( t) ) t [0, ]} H :[0, ] [0, ] (K, K ) H(x, a) = (E[p 0 (G x,a, a, a )], E[p (G x,a, a, a )]). The following claims are immediate. Journal of Graph Theory DOI 0.002/jgt
7 . H(x, 0) = (x,( x) + ( x) 2 x). 2. H(x, ) = (( x) + ( x) 2 x, x ). H(, a) = (( a), a ) 4. H(x, 2 ) = ( 8, 8 ). 5. H(0, a) = (a,( a) ) ON THE -LOCAL PROFILES OF GRAPHS 7 H [0,] [0, 2 ] is a continuous map from a topological 2-disc. The boundary of this disk is mapped to a path encircling C 2 C. Therefore, C 2 C is contractible in im(h), and consequently the region bounded by C 2 and C is contained in im(h), and also in (K, K ). A similar argument for H [0,] [ 2,] shows that the region bounded by C and C is contained in (K, K ). The remaining area in (K, K ) will be covered similarly. Consider the following continuous map, H :[0, ] [0, ] (K, K ) H (x, a) = (E[p 0 (G x,a,a, a )], E[p (G x,a,a, a )]). Again, the following claims are immediate.. H (x, 0) = (x + ( x), 0) 2. H ( 2, a) = 8 ( (2a ), + (2a ) ). H (x, ) = (0, x + ( x) ) 4. H (0, a) = (( a), a ) H [0, 2 ] [0,] is a continuous map from a topological 2-disc, mapping its boundary to a path encircling C, [ 4, ] {0}, {( t 4, t 4 ) t [0, ]} and {0} [, ]. Therefore, as 4 before, the region between these curves is contained in (K, K ). Altogether, B B 2 (K, K ) is obtained. 4. FLAG ALGEBRAS A DUAL PERSPECTIVE Let G be an infinite family of graphs closed under taking induced subgraphs, let H = (H,..., H t ) a collection of graphs. We formulate necessary conditions for membership in the set G (H) that are stated in terms of feasibility of some SDP. This part is selfcontained, and concentrates on the connections between the theory of flag algebras and standard arguments in discrete optimization. Definition 4.. An (s, k)-flagged graph F = (H,U ) consists of an s-vertex graph H and a flag U = (u,..., u k ),anordered set of k vertices in H. An isomorphism F = F between flagged graphs F = (H,U ) and F = (H,U ) is a graph isomorphism ϕ : V (H) V (H ) such that ϕ(u i ) = u i Definition 4.2. Let G beagraphandf, F 2 be (s, k)-flagged graphs. Choose uniformly at random two subsets (V,V 2 ) of V (G) of size s with intersection U = V V 2 of cardinality k and choose a random ordering of U.Define Journal of Graph Theory DOI 0.002/jgt p(f, F 2 ; G) = Pr[F i = (G Vi,U ) i =, 2]. i.
8 8 JOURNAL OF GRAPH THEORY Associated with every list F,..., F l of (s, k)-flagged graphs is the l l matrix A G = A G (F,..., F l ) i, j A G (F,..., F l ) i, j = p(f i, F j ; G). Note that A G is a symmetric matrix. Example 4.. Denote by e (resp. e) the edge (its complement) with one flagged vertex. Also, P denotes the path on vertices. Then ( ) 0 A P (ē, e) = Proof. Let V,V 2 V (P ) be chosen randomly with V = V 2 =2and V V 2 =. First, p(ē, ē; P ) = 0 since either V or V 2 spans an edge. Also, p(e, e; P ) = since both sets span an edge if their common vertex has degree 2. Finally, p(ē, e; P ) = since the common vertex has degree with probability 2/, and conditioned on that, the first set V spans an edge with probability /2. We denote by PSD(l) the cone of l l positive semidefinite matrices. The following theorem is an analog of Theorem. in [20]. Theorem 4.4. Let F i, i =,..., l, be (s, k)-flagged graphs. For an n-vertex graph G, dist ( A G (F,..., F l ), PSD(l) ) ( ) = O n where dist stands for distance in l 2. Corollary 4.5. LetG be a class of graphs that is closed under taking induced subgraphs. Let G n be the set of n-vertex members of G.LetH = (H,..., H t ) be a complete list of all the isomorphism types of graphs in G r.letf i, i =,..., lbe(s, k)-flagged graphs. Then for every (p,..., p t ) G (H), t p α A H α (F,..., F l ) 0. α= Let us illustrate how this corollary helps us derive an upper bound on lim n max G Gn d(h; G) for some fixed graph H. (The limit exists since max G Gn d(h; G) is a nonincreasing function of n). Note that t d(h; G) = d(h; H α )d(h α ; G). α= Therefore the following SDP yields an upper bound t max d(h; H α )p α α= all p α 0 and s.t. p α = t p α A H α (F,..., F l ) 0 α= Journal of Graph Theory DOI 0.002/jgt α
9 ON THE -LOCAL PROFILES OF GRAPHS 9 By SDP duality, this maximum can be also upper-bounded by ( [ min max d(h; Hα ) + Tr(Q A H α ) ]) Q PSD(l) α t that is the more familiar form of SDP used in the literature on applications of flag algebras (see, e.g. [,22] ). The proofs of the above two statements are based on standard arguments. Theorem 4.4 Corollary 4.5. vertices, A G (F,..., F l ) = Namely, that for every i, j l, p(f i, F j ; G) = First we prove that for every graph G on at least r t d(h α ; G)A H α (F,..., F l ). α= t d(h α ; G)p(F i, F j ; H α ). α= This is just an application of the law of total probability. On the LHS we sample uniformly two sets V,V 2 of size s with V V 2 =k from V (G) together with a random ordering of V V 2, and on the RHS we first sample a random setv of size r fromv (G), and then uniformly sample V,V 2 as above from V. To finish the proof, let p = (p,..., p t ) G (H). By the definition of G (H) and Theorem 4.4, for every ɛ>0 there is a sufficiently large graph G G such that both and Therefore, dist ( α p αa H α, PSD(l) ) = 0. p α d(h α ; G) <ɛ α ( ) dist d(h α ; G)A H α, PSD(l) <ɛ. α Proof of Theorem 4.4. Let G be an n-vertex graph. Consider the following equivalent description of the underlying distribution in the definition of the matrix A G = A G (F,..., F l ). Choose uniformly at random an ordered set U V (G) of size k, twodisjoint sets S, S 2 V (G) \ U of size s k and let V i = S i U, i =, 2. Thus A G i, j is the probability that F i = (G Vi,U ), fori =, 2. Note that for every fixed U, two sets S, S 2 V (G) \ U of size s k chosen uniformly and independently at random are disjoint with probability O(/n). Therefore, it suffices to prove that the matrix B G, defined exactly as A G except that S, S 2 are chosen independently, is PSD. n! Consider the matrix Q with l rows and columns indexed by ordered sets U (n k)! V (G) of size k, defined as following. Choose a random subset S V (G) \ U of size s k,andletq i,u = Pr[F i = (G S U,U )]. Then, B G = (n k)! QQ T 0 n! Journal of Graph Theory DOI 0.002/jgt
10 0 JOURNAL OF GRAPH THEORY 5. TRIANGLE-FREE GRAPHS In this section, we prove Theorem., by showing that the set TF (K, P, P ) is characterized by the quadratic constraints deduced from the flag algebra theory. Proof of Theorem.. (I) (II). This implication is a direct application of Corollary 4.5 Let e,e be (2,)-flagged graphs. e (resp. e) is the empty (complete) graph over two vertices with one flagged vertex. By a straightforward computation (See example 4.), ( ) ( ) ( ) A K 0 (ē, e) =, A P (ē, e) =, A P 0 (ē, e) = FIGURE 2. Triangle free graphs and flagged graphs used in the proof. Since these are all the graphs on three vertices in the family TF, we may apply Corollary 4.5, and obtain (II). (II) (III). Suppose p 0, p, p 2 satisfy the condition in (II).Sincep 0 + p + p 2 =, this can be reformulated as (p0 ) + p p 0 0, p 0 p 0 p which implies that 0 (p 0 + p )( p 0 p ) ( p 0 ) 2, () p 0 + p. Recall Definition. of G x,a,b,c, and denote G α,q := G α,0,0,q a distribution on bipartite graphs, for α, q [0, ]. Then, E[p 0 (G α,q )] = α( α)q(2 q) + o(). Journal of Graph Theory DOI 0.002/jgt E[p (G α,q )] = 6α( α)q( q) + o().
11 ON THE -LOCAL PROFILES OF GRAPHS By Lemma 2., for every α, q, (E[p 0 (G α,q ]), E[p (G α,q )], E[p 2 (G α,q )]) BP (K, P, P ). Thus, it suffices, given p 0, p that satisfy (), to find (α, q) [0, ] 2 such that, p 0 = α( α)q(2 q), and p = 6α( α)q( q). This implies that and q = 2 2p 0 2p 2 2p 0 p [0, ], ( 2α) 2 = (p 0 + p )( p 0 p ) ( p 0 ) 2 ( p 0 p ) Miraculously, α [0, ] that satisfies this equation exists if the quadratic constraint in () are satisfied and p 0 + p <. Indeed it is easy to check that in this case the right hand side is nonnegative and is. On the other hand, if p 0 + p =, then by () p 0 = and this profile is attained for q = 0. FIGURE. The region of possible p 0, p of triangle-free graphs. (III) (I). Immediate, since every bipartite graph is triangle free. 6. CONCLUDING REMARKS In this article, we study the set S R 4 of all vectors (p 0,..., p ) that are arbitrarily close to the -local profiles of arbitrarily large graphs. We show that the projection of this set to the (p 0, p ) plane is completely realizable by the graphs that are generated by a model that partitions the vertices into two sets. We also show that the intersection of S with the plane p = 0, i.e. triangle-free graphs, is completely realizable by a simple model of random bipartite graphs. We wonder how far these observations can be extended. Razborov s work [2] shows that certain -profiles require the use of k-partite models for arbitrarily large k. Also in general, it is not true that a k-local profile of every K k -free Journal of Graph Theory DOI 0.002/jgt
12 2 JOURNAL OF GRAPH THEORY graph can be realized by (k )-partite graph. Indeed, it was shown in [], that already for k 4 the minimum density of empty sets of size k in K k -free graphs is strictly smaller than what can be achieved by (k )-partite graphs. It still remains a challenge to get a full description of the set S. The analogous questions concerning r-profiles, r > seem even more difficult. Even characterizing the profiles of (r-cliques, r-anticliques), which is solved here for r =, is still open. REFERENCES [] B. Bollobás, C. Nara, and S. Tachibana, The maximal number of induced complete bipartite graphs, Discrete Math 62 (986), [2] J. I. Brown and A. Sidorenko, The inducibility of complete bipartite graphs, J Graph Theory 8 (994), [] S. Das, H. Huang, J. Ma, H. Naves, and B. Sudakov, A problem of Erdős on the minimum of k-cliques, J Combin Theory Ser B 0 (20), 4 7. [4] P. Erdős, D. J. Kleitman, and B. L. Rothschild, Asymptotic enumeration of K n -free graphs, Theorie Combinatorie, Proceedings of the Conference, Vol. II, Rome, 97, Roma, Acad Nazionale dei Lincei, 976, pp [5] P. Erdős, On the number of complete subgraphs contained in certain graphs, Magyar Tud Akad Mat KutatóIntKözl 7 (962), [6] P. Erdös and A. H. Stone, On the structure of linear graphs, Bull Am Math Soc 52 (946), [7] G. Exoo, Dense packings of induced subgraphs, Ars Combin 22 (986), 5 0. [8] F. Franek and V. Rödl, 2-colorings of complete graphs with small number of monochromatic K 4 subgraphs, Discrete Math 4 (99), [9] G. Giraud, Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey, J Combin Theory, Series B 27 (979), [0] A. W. Goodman, On sets of acquaintances and strangers at any party, Am Math Monthly (959), [] H. Hatami, J. Hirst, and S. Norine, The inducibility of blow-up graphs, arxiv preprint arxiv: , 20. [2] H. Hatami and S. Norine, Undecidability of linear inequalities in graph homomorphism densities, J Am Math Soc 24 (20), [] J. Hirst, The inducibility of graphs on four vertices, arxiv preprint arxiv:09.592, 20. [4] H. Huang, N. Linial, H. Naves, Y. Peled, and B. Sudakov, On the densities of cliques and independent sets in graphs (submitted). [5] G. Katona, A Theorem of Finite Sets, Theory of Graphs, Akadémia Kiadó, Budapest, 968, pp [6] J. Kruskal, The Number of Simplices in a Complex, Mathematical Optimization Techniques, Univ. of California Press, 96, pp [7] V. Nikiforov, The number of cliques in graphs of given order and size, Trans Am Math Soc 6 (20), Journal of Graph Theory DOI 0.002/jgt
13 ON THE -LOCAL PROFILES OF GRAPHS [8] O. Pikhurko, Minimum number of k-cliques in graphs with bounded independence number (submitted). [9] N. Pippenger and M. C. Golumbic, The inducibility of graphs, J Combin Theory, Series B 9 (975), [20] A. A. Razborov, Flag algebras, J Symbolic Logic 72 (2007), [2] A. A. Razborov, On the minimal density of triangles in graphs, Combin Prob Comput 7 (2008), [22] A. A. Razborov, On -hypergraphs with forbidden 4-vertex configurations, SIAM J Discrete Math 24 (200), [2] C. Reiher, Minimizing the number of cliques in graphs of given order and edge density, manuscript. [24] K. Sperfeld, On the minimal monochromatic K 4 -density, arxiv preprint arxiv:06.00, 20. [25] A. Thomason, A disproof of a conjecture of Erdős in Ramsey theory, J London Math Soc 2 (989), Journal of Graph Theory DOI 0.002/jgt
On the 3-local profiles of graphs
On the -local profiles of graphs Hao Huang Nati Linial Humberto Naves Yuval Peled Benny Sudakov Abstract For a graph G, let p i (G), i = 0,..., be the probability that three distinct random vertices span
More informationOn the densities of cliques and independent sets in graphs
On the densities of cliques and independent sets in graphs Hao Huang Nati Linial Humberto Naves Yuval Peled Benny Sudakov Abstract Let r, s 2 be integers. Suppose that the number of blue r-cliques in a
More informationOn the Local Profiles of Trees
On the Local Profiles of Trees Sébastien Bubeck 1 and Nati Linial 1 DEPARTMENT OF OPERATIONS RESEARCH AND FINANCIAL ENGINEERING PRINCETON UNIVERSITY PRINCETON 08540, NJ E-mail: sbubeck@princeton.edu SCHOOL
More informationA Note on the Inducibility of 4-Vertex Graphs
DOI 10.1007/s00373-014-1475-4 ORIGINAL PAPER A Note on the Inducibility of 4-Vertex Graphs Chaim Even-Zohar Nati Linial Received: 4 December 2013 / Revised: 12 August 2014 Springer Japan 2014 Abstract
More informationUndecidability of Linear Inequalities Between Graph Homomorphism Densities
Undecidability of Linear Inequalities Between Graph Homomorphism Densities Hamed Hatami joint work with Sergey Norin School of Computer Science McGill University December 4, 2013 Hamed Hatami (McGill University)
More informationNonnegative k-sums, fractional covers, and probability of small deviations
Nonnegative k-sums, fractional covers, and probability of small deviations Noga Alon Hao Huang Benny Sudakov Abstract More than twenty years ago, Manickam, Miklós, and Singhi conjectured that for any integers
More informationMaximum union-free subfamilies
Maximum union-free subfamilies Jacob Fox Choongbum Lee Benny Sudakov Abstract An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called
More informationInduced subgraphs of prescribed size
Induced subgraphs of prescribed size Noga Alon Michael Krivelevich Benny Sudakov Abstract A subgraph of a graph G is called trivial if it is either a clique or an independent set. Let q(g denote the maximum
More informationNear-domination in graphs
Near-domination in graphs Bruce Reed Researcher, Projet COATI, INRIA and Laboratoire I3S, CNRS France, and Visiting Researcher, IMPA, Brazil Alex Scott Mathematical Institute, University of Oxford, Oxford
More informationThe number of edge colorings with no monochromatic cliques
The number of edge colorings with no monochromatic cliques Noga Alon József Balogh Peter Keevash Benny Sudaov Abstract Let F n, r, ) denote the maximum possible number of distinct edge-colorings of a simple
More informationMaximizing the number of independent sets of a fixed size
Maximizing the number of independent sets of a fixed size Wenying Gan Po-Shen Loh Benny Sudakov Abstract Let i t (G be the number of independent sets of size t in a graph G. Engbers and Galvin asked how
More informationRamsey-type problem for an almost monochromatic K 4
Ramsey-type problem for an almost monochromatic K 4 Jacob Fox Benny Sudakov Abstract In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph K n with
More informationAn exact Turán result for tripartite 3-graphs
An exact Turán result for tripartite 3-graphs Adam Sanitt Department of Mathematics University College London WC1E 6BT, United Kingdom adam@sanitt.com John Talbot Department of Mathematics University College
More informationMaximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle József Balogh Ping Hu Bernard Lidický Florian Pfender September 1, 2015 Abstract Let C(n) denote the maximum number of induced
More informationStability of the path-path Ramsey number
Worcester Polytechnic Institute Digital WPI Computer Science Faculty Publications Department of Computer Science 9-12-2008 Stability of the path-path Ramsey number András Gyárfás Computer and Automation
More informationarxiv: v1 [math.co] 29 Nov 2018
ON THE INDUCIBILITY OF SMALL TREES AUDACE A. V. DOSSOU-OLORY AND STEPHAN WAGNER arxiv:1811.1010v1 [math.co] 9 Nov 018 Abstract. The quantity that captures the asymptotic value of the maximum number of
More informationGRAPHS CONTAINING TRIANGLES ARE NOT 3-COMMON
GRAPHS CONTAINING TRIANGLES ARE NOT 3-COMMON JAMES CUMMINGS AND MICHAEL YOUNG Abstract. A finite graph G is k-common if the minimum (over all k- colourings of the edges of K n) of the number of monochromatic
More informationVariants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems
Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems Dhruv Mubayi December 19, 2016 Abstract Given integers l, n, the lth power of the path P n is the ordered graph Pn l with vertex set v 1
More informationSize and degree anti-ramsey numbers
Size and degree anti-ramsey numbers Noga Alon Abstract A copy of a graph H in an edge colored graph G is called rainbow if all edges of H have distinct colors. The size anti-ramsey number of H, denoted
More informationAcyclic subgraphs with high chromatic number
Acyclic subgraphs with high chromatic number Safwat Nassar Raphael Yuster Abstract For an oriented graph G, let f(g) denote the maximum chromatic number of an acyclic subgraph of G. Let f(n) be the smallest
More informationc 2010 Society for Industrial and Applied Mathematics
SIAM J. DISCRETE MATH. Vol. 24, No. 3, pp. 1038 1045 c 2010 Society for Industrial and Applied Mathematics SET SYSTEMS WITHOUT A STRONG SIMPLEX TAO JIANG, OLEG PIKHURKO, AND ZELEALEM YILMA Abstract. A
More informationMaximum density of an induced 5-cycle is achieved by an iterated blow-up of a 5-cycle
Maximum density of an induced 5-cycle is achieved by an iterated blow-up of a 5-cycle József Balogh Ping Hu Bernard Lidický Florian Pfender arxiv:1411.4645v1 [math.co] 17 Nov 2014 October 19, 2018 Abstract
More informationChromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz Jacob Fox Choongbum Lee Benny Sudakov Abstract For a graph G, let χ(g) denote its chromatic number and σ(g) denote
More informationList coloring hypergraphs
List coloring hypergraphs Penny Haxell Jacques Verstraete Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario, Canada pehaxell@uwaterloo.ca Department of Mathematics University
More informationParity Versions of 2-Connectedness
Parity Versions of 2-Connectedness C. Little Institute of Fundamental Sciences Massey University Palmerston North, New Zealand c.little@massey.ac.nz A. Vince Department of Mathematics University of Florida
More informationGraphs with Large Variance
Graphs with Large Variance Yair Caro Raphael Yuster Abstract For a graph G, let V ar(g) denote the variance of the degree sequence of G, let sq(g) denote the sum of the squares of the degrees of G, and
More informationPaul Erdős and Graph Ramsey Theory
Paul Erdős and Graph Ramsey Theory Benny Sudakov ETH and UCLA Ramsey theorem Ramsey theorem Definition: The Ramsey number r(s, n) is the minimum N such that every red-blue coloring of the edges of a complete
More informationARRANGEABILITY AND CLIQUE SUBDIVISIONS. Department of Mathematics and Computer Science Emory University Atlanta, GA and
ARRANGEABILITY AND CLIQUE SUBDIVISIONS Vojtěch Rödl* Department of Mathematics and Computer Science Emory University Atlanta, GA 30322 and Robin Thomas** School of Mathematics Georgia Institute of Technology
More informationCharacterizing extremal limits
Characterizing extremal limits Oleg Pikhurko University of Warwick ICERM, 11 February 2015 Rademacher Problem g(n, m) := min{#k 3 (G) : v(g) = n, e(g) = m} Mantel 1906, Turán 41: max{m : g(n, m) = 0} =
More informationDecomposing oriented graphs into transitive tournaments
Decomposing oriented graphs into transitive tournaments Raphael Yuster Department of Mathematics University of Haifa Haifa 39105, Israel Abstract For an oriented graph G with n vertices, let f(g) denote
More informationProbabilistic Method. Benny Sudakov. Princeton University
Probabilistic Method Benny Sudakov Princeton University Rough outline The basic Probabilistic method can be described as follows: In order to prove the existence of a combinatorial structure with certain
More informationarxiv: v2 [math.co] 19 Jun 2018
arxiv:1705.06268v2 [math.co] 19 Jun 2018 On the Nonexistence of Some Generalized Folkman Numbers Xiaodong Xu Guangxi Academy of Sciences Nanning 530007, P.R. China xxdmaths@sina.com Meilian Liang School
More informationPacking triangles in regular tournaments
Packing triangles in regular tournaments Raphael Yuster Abstract We prove that a regular tournament with n vertices has more than n2 11.5 (1 o(1)) pairwise arc-disjoint directed triangles. On the other
More informationTHE ASYMPTOTIC NUMBER OF TRIPLE SYSTEMS NOT CONTAINING A FIXED ONE
THE ASYMPTOTIC NUMBER OF TRIPLE SYSTEMS NOT CONTAINING A FIXED ONE BRENDAN NAGLE AND VOJTĚCH RÖDL Abstract. For a fixed 3-uniform hypergraph F, call a hypergraph F-free if it contains no subhypergraph
More informationThe Turán number of sparse spanning graphs
The Turán number of sparse spanning graphs Noga Alon Raphael Yuster Abstract For a graph H, the extremal number ex(n, H) is the maximum number of edges in a graph of order n not containing a subgraph isomorphic
More informationOn Generalized Ramsey Numbers
On Generalized Ramsey Numbers Wai Chee Shiu, Peter Che Bor Lam and Yusheng Li Abstract Let f 1 and f 2 be graph parameters. The Ramsey number rf 1 m; f 2 n is defined as the minimum integer N such that
More informationRainbow triangles in 3-edge-colored graphs
Rainbow triangles in 3-edge-colored graphs József Balogh, Ping Hu, Bernard Lidický, Florian Pfender, Jan Volec, Michael Young SIAM Conference on Discrete Mathematics Jun 17, 2014 2 Problem Find a 3-edge-coloring
More informationNew lower bounds for hypergraph Ramsey numbers
New lower bounds for hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1,..., N}, there
More informationOn the Logarithmic Calculus and Sidorenko s Conjecture
On the Logarithmic Calculus and Sidorenko s Conjecture by Xiang Li A thesis submitted in conformity with the requirements for the degree of Msc. Mathematics Graduate Department of Mathematics University
More informationA Construction of Almost Steiner Systems
A Construction of Almost Steiner Systems Asaf Ferber, 1 Rani Hod, 2 Michael Krivelevich, 1 and Benny Sudakov 3,4 1 School of Mathematical Sciences, Raymond and Beverly Sackler Faculty of Exact Sciences,
More informationQuadruple Systems with Independent Neighborhoods
Quadruple Systems with Independent Neighborhoods Zoltan Füredi Dhruv Mubayi Oleg Pikhurko Abstract A -graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both
More informationEdge-disjoint induced subgraphs with given minimum degree
Edge-disjoint induced subgraphs with given minimum degree Raphael Yuster Department of Mathematics University of Haifa Haifa 31905, Israel raphy@math.haifa.ac.il Submitted: Nov 9, 01; Accepted: Feb 5,
More informationOn the number of edge-disjoint triangles in K 4 -free graphs
On the number of edge-disjoint triangles in K 4 -free graphs arxiv:1506.03306v1 [math.co] 10 Jun 2015 Ervin Győri Rényi Institute Hungarian Academy of Sciences Budapest, Hungary gyori.ervin@renyi.mta.hu
More informationKatarzyna Mieczkowska
Katarzyna Mieczkowska Uniwersytet A. Mickiewicza w Poznaniu Erdős conjecture on matchings in hypergraphs Praca semestralna nr 1 (semestr letni 010/11 Opiekun pracy: Tomasz Łuczak ERDŐS CONJECTURE ON MATCHINGS
More informationLarge induced trees in K r -free graphs
Large induced trees in K r -free graphs Jacob Fox Po-Shen Loh Benny Sudakov Abstract For a graph G, let t(g) denote the maximum number of vertices in an induced subgraph of G that is a tree. In this paper,
More informationOff-diagonal hypergraph Ramsey numbers
Off-diagonal hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum such that every red-blue coloring of the k- subsets of {1,..., } contains a red set of
More informationOn the chromatic number and independence number of hypergraph products
On the chromatic number and independence number of hypergraph products Dhruv Mubayi Vojtĕch Rödl January 10, 2004 Abstract The hypergraph product G H has vertex set V (G) V (H), and edge set {e f : e E(G),
More informationVertex colorings of graphs without short odd cycles
Vertex colorings of graphs without short odd cycles Andrzej Dudek and Reshma Ramadurai Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 1513, USA {adudek,rramadur}@andrew.cmu.edu
More informationNorm-graphs: variations and applications
Norm-graphs: variations and applications Noga Alon 1 School of Mathematics, Institute for Advanced Study Olden Lane, Princeton, NJ 08540 and Department of Mathematics, Tel Aviv University Tel Aviv, Israel
More informationarxiv: v1 [math.co] 2 Dec 2013
What is Ramsey-equivalent to a clique? Jacob Fox Andrey Grinshpun Anita Liebenau Yury Person Tibor Szabó arxiv:1312.0299v1 [math.co] 2 Dec 2013 November 4, 2018 Abstract A graph G is Ramsey for H if every
More informationIndependent Transversals in r-partite Graphs
Independent Transversals in r-partite Graphs Raphael Yuster Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract Let G(r, n) denote
More informationOn Some Three-Color Ramsey Numbers for Paths
On Some Three-Color Ramsey Numbers for Paths Janusz Dybizbański, Tomasz Dzido Institute of Informatics, University of Gdańsk Wita Stwosza 57, 80-952 Gdańsk, Poland {jdybiz,tdz}@inf.ug.edu.pl and Stanis
More informationThe Number of Independent Sets in a Regular Graph
Combinatorics, Probability and Computing (2010) 19, 315 320. c Cambridge University Press 2009 doi:10.1017/s0963548309990538 The Number of Independent Sets in a Regular Graph YUFEI ZHAO Department of Mathematics,
More informationConstructive bounds for a Ramsey-type problem
Constructive bounds for a Ramsey-type problem Noga Alon Michael Krivelevich Abstract For every fixed integers r, s satisfying r < s there exists some ɛ = ɛ(r, s > 0 for which we construct explicitly an
More informationCycle lengths in sparse graphs
Cycle lengths in sparse graphs Benny Sudakov Jacques Verstraëte Abstract Let C(G) denote the set of lengths of cycles in a graph G. In the first part of this paper, we study the minimum possible value
More informationTripartite Ramsey Numbers for Paths
Tripartite Ramsey Numbers for Paths András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy,,2 and Endre Szemerédi 3 COMPUTER AND AUTOMATION RESEARCH INSTITUTE HUNGARIAN ACADEMY OF SCIENCES BUDAPEST, P.O. BOX
More informationPlanar Ramsey Numbers for Small Graphs
Planar Ramsey Numbers for Small Graphs Andrzej Dudek Department of Mathematics and Computer Science Emory University Atlanta, GA 30322, USA Andrzej Ruciński Faculty of Mathematics and Computer Science
More informationDecomposition of random graphs into complete bipartite graphs
Decomposition of random graphs into complete bipartite graphs Fan Chung Xing Peng Abstract We consider the problem of partitioning the edge set of a graph G into the minimum number τg) of edge-disjoint
More informationUsing Lovász Local Lemma in the space of random injections
Using Lovász Local Lemma in the space of random injections Linyuan Lu László Székely University of South Carolina {lu, szekely}@math.sc.edu Submitted: Nov 6, 2006; Accepted: Sep 3, 2007; Published: Sep
More informationSome Nordhaus-Gaddum-type Results
Some Nordhaus-Gaddum-type Results Wayne Goddard Department of Mathematics Massachusetts Institute of Technology Cambridge, USA Michael A. Henning Department of Mathematics University of Natal Pietermaritzburg,
More informationSmall subgraphs of random regular graphs
Discrete Mathematics 307 (2007 1961 1967 Note Small subgraphs of random regular graphs Jeong Han Kim a,b, Benny Sudakov c,1,vanvu d,2 a Theory Group, Microsoft Research, Redmond, WA 98052, USA b Department
More informationBisections of graphs
Bisections of graphs Choongbum Lee Po-Shen Loh Benny Sudakov Abstract A bisection of a graph is a bipartition of its vertex set in which the number of vertices in the two parts differ by at most 1, and
More informationAsymptotically optimal induced universal graphs
Asymptotically optimal induced universal graphs Noga Alon Abstract We prove that the minimum number of vertices of a graph that contains every graph on vertices as an induced subgraph is (1 + o(1))2 (
More informationMinimal Paths and Cycles in Set Systems
Minimal Paths and Cycles in Set Systems Dhruv Mubayi Jacques Verstraëte July 9, 006 Abstract A minimal k-cycle is a family of sets A 0,..., A k 1 for which A i A j if and only if i = j or i and j are consecutive
More informationMulti-coloring and Mycielski s construction
Multi-coloring and Mycielski s construction Tim Meagher Fall 2010 Abstract We consider a number of related results taken from two papers one by W. Lin [1], and the other D. C. Fisher[2]. These articles
More informationThe typical structure of maximal triangle-free graphs
The typical structure of maximal triangle-free graphs József Balogh Hong Liu Šárka Petříčková Maryam Sharifzadeh September 3, 2018 arxiv:1501.02849v1 [math.co] 12 Jan 2015 Abstract Recently, settling a
More informationRING ELEMENTS AS SUMS OF UNITS
1 RING ELEMENTS AS SUMS OF UNITS CHARLES LANSKI AND ATTILA MARÓTI Abstract. In an Artinian ring R every element of R can be expressed as the sum of two units if and only if R/J(R) does not contain a summand
More informationOut-colourings of Digraphs
Out-colourings of Digraphs N. Alon J. Bang-Jensen S. Bessy July 13, 2017 Abstract We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an out-colouring.
More informationOn Ramsey numbers of uniform hypergraphs with given maximum degree
Journal of Combinatorial Theory, Series A 113 (2006) 1555 1564 www.elsevier.com/locate/jcta ote On Ramsey numbers of uniform hypergraphs with given maximum degree A.V. Kostochka a,b,1, V. Rödl c,2 a Department
More informationRainbow Hamilton cycles in uniform hypergraphs
Rainbow Hamilton cycles in uniform hypergraphs Andrzej Dude Department of Mathematics Western Michigan University Kalamazoo, MI andrzej.dude@wmich.edu Alan Frieze Department of Mathematical Sciences Carnegie
More informationON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS
ON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS PATRICK BENNETT, ANDRZEJ DUDEK, ELLIOT LAFORGE December 1, 016 Abstract. Let C [r] m be a code such that any two words of C have Hamming
More informationA Hilton-Milner-type theorem and an intersection conjecture for signed sets
A Hilton-Milner-type theorem and an intersection conjecture for signed sets Peter Borg Department of Mathematics, University of Malta Msida MSD 2080, Malta p.borg.02@cantab.net Abstract A family A of sets
More informationForbidding complete hypergraphs as traces
Forbidding complete hypergraphs as traces Dhruv Mubayi Department of Mathematics, Statistics, and Computer Science University of Illinois Chicago, IL 60607 Yi Zhao Department of Mathematics and Statistics
More informationOn two problems in Ramsey-Turán theory
On two problems in Ramsey-Turán theory József Balogh Hong Liu Maryam Sharifzadeh July 7, 016 Abstract Alon, Balogh, Keevash and Sudakov proved that the (k 1)-partite Turán graph maximizes the number of
More informationIMA Preprint Series # 2385
LIST COLORINGS WITH DISTINCT LIST SIZES, THE CASE OF COMPLETE BIPARTITE GRAPHS By Zoltán Füredi and Ida Kantor IMA Preprint Series # 2385 ( October 2011 ) INSTITUTE FOR MATHEMATICS AND ITS APPLICATIONS
More informationHAMILTONIAN CYCLES AVOIDING SETS OF EDGES IN A GRAPH
HAMILTONIAN CYCLES AVOIDING SETS OF EDGES IN A GRAPH MICHAEL J. FERRARA, MICHAEL S. JACOBSON UNIVERSITY OF COLORADO DENVER DENVER, CO 8017 ANGELA HARRIS UNIVERSITY OF WISCONSIN-WHITEWATER WHITEWATER, WI
More informationA generalized Turán problem in random graphs
A generalized Turán problem in random graphs Wojciech Samotij Clara Shikhelman June 18, 2018 Abstract We study the following generalization of the Turán problem in sparse random graphs Given graphs T and
More informationApplications of the Lopsided Lovász Local Lemma Regarding Hypergraphs
Regarding Hypergraphs Ph.D. Dissertation Defense April 15, 2013 Overview The Local Lemmata 2-Coloring Hypergraphs with the Original Local Lemma Counting Derangements with the Lopsided Local Lemma Lopsided
More informationRamsey Unsaturated and Saturated Graphs
Ramsey Unsaturated and Saturated Graphs P Balister J Lehel RH Schelp March 20, 2005 Abstract A graph is Ramsey unsaturated if there exists a proper supergraph of the same order with the same Ramsey number,
More informationThe typical structure of sparse K r+1 -free graphs
The typical structure of sparse K r+1 -free graphs Lutz Warnke University of Cambridge (joint work with József Balogh, Robert Morris, and Wojciech Samotij) H-free graphs / Turán s theorem Definition Let
More informationTurán H-densities for 3-graphs
Turán H-densities for 3-graphs Victor Falgas Ravry Institutionen för matematik och matematik statistik Umeå Universitet Sweden victor.falgas-ravry@math.umu.se Emil R. Vaughan School of Electronic Engineering
More informationOn tight cycles in hypergraphs
On tight cycles in hypergraphs Hao Huang Jie Ma Abstract A tight k-uniform l-cycle, denoted by T Cl k, is a k-uniform hypergraph whose vertex set is v 0,, v l 1, and the edges are all the k-tuples {v i,
More informationCross-Intersecting Sets of Vectors
Cross-Intersecting Sets of Vectors János Pach Gábor Tardos Abstract Given a sequence of positive integers p = (p 1,..., p n ), let S p denote the set of all sequences of positive integers x = (x 1,...,
More informationAsymptotically optimal induced universal graphs
Asymptotically optimal induced universal graphs Noga Alon Abstract We prove that the minimum number of vertices of a graph that contains every graph on vertices as an induced subgraph is (1+o(1))2 ( 1)/2.
More informationMONOCHROMATIC TRIANGLES IN THREE-COLOURED GRAPHS
MONOCHROMATIC TRIANGLES IN THREE-COLOURED GRAPHS JAMES CUMMINGS, DANIEL KRÁL, FLORIAN PFENDER, KONRAD SPERFELD, ANDREW TREGLOWN, AND MICHAEL YOUNG Abstract. In 1959, Goodman [9] determined the minimum
More informationTesting Equality in Communication Graphs
Electronic Colloquium on Computational Complexity, Report No. 86 (2016) Testing Equality in Communication Graphs Noga Alon Klim Efremenko Benny Sudakov Abstract Let G = (V, E) be a connected undirected
More informationProperly colored Hamilton cycles in edge colored complete graphs
Properly colored Hamilton cycles in edge colored complete graphs N. Alon G. Gutin Dedicated to the memory of Paul Erdős Abstract It is shown that for every ɛ > 0 and n > n 0 (ɛ), any complete graph K on
More informationZero-sum square matrices
Zero-sum square matrices Paul Balister Yair Caro Cecil Rousseau Raphael Yuster Abstract Let A be a matrix over the integers, and let p be a positive integer. A submatrix B of A is zero-sum mod p if the
More informationNote on Vertex-Disjoint Cycles
Note on Vertex-Disjoint Cycles Jacques Verstraëte Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences Wilberforce Road, Cambridge CB3 OWB England. November 999.
More informationRandom Lifts of Graphs
27th Brazilian Math Colloquium, July 09 Plan of this talk A brief introduction to the probabilistic method. A quick review of expander graphs and their spectrum. Lifts, random lifts and their properties.
More informationInduced Ramsey-type theorems
Induced Ramsey-type theorems Jacob Fox Benny Sudakov Abstract We present a unified approach to proving Ramsey-type theorems for graphs with a forbidden induced subgraph which can be used to extend and
More informationRON AHARONI, NOGA ALON, AND ELI BERGER
EIGENVALUES OF K 1,k -FREE GRAPHS AND THE CONNECTIVITY OF THEIR INDEPENDENCE COMPLEXES RON AHARONI, NOGA ALON, AND ELI BERGER Abstract. Let G be a graph on n vertices, with maximal degree d, and not containing
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More informationA prolific construction of strongly regular graphs with the n-e.c. property
A prolific construction of strongly regular graphs with the n-e.c. property Peter J. Cameron and Dudley Stark School of Mathematical Sciences Queen Mary, University of London London E1 4NS, U.K. Abstract
More informationTHE EXTREMAL FUNCTIONS FOR TRIANGLE-FREE GRAPHS WITH EXCLUDED MINORS 1
THE EXTREMAL FUNCTIONS FOR TRIANGLE-FREE GRAPHS WITH EXCLUDED MINORS 1 Robin Thomas and Youngho Yoo School of Mathematics Georgia Institute of Technology Atlanta, Georgia 0-0160, USA We prove two results:
More informationSIZE-RAMSEY NUMBERS OF CYCLES VERSUS A PATH
SIZE-RAMSEY NUMBERS OF CYCLES VERSUS A PATH ANDRZEJ DUDEK, FARIDEH KHOEINI, AND PAWE L PRA LAT Abstract. The size-ramsey number ˆRF, H of a family of graphs F and a graph H is the smallest integer m such
More informationRainbow Hamilton cycles in uniform hypergraphs
Rainbow Hamilton cycles in uniform hypergraphs Andrzej Dude Department of Mathematics Western Michigan University Kalamazoo, MI andrzej.dude@wmich.edu Alan Frieze Department of Mathematical Sciences Carnegie
More informationInduced subgraphs with many repeated degrees
Induced subgraphs with many repeated degrees Yair Caro Raphael Yuster arxiv:1811.071v1 [math.co] 17 Nov 018 Abstract Erdős, Fajtlowicz and Staton asked for the least integer f(k such that every graph with
More informationAn Introduction to Transversal Matroids
An Introduction to Transversal Matroids Joseph E Bonin The George Washington University These slides and an accompanying expository paper (in essence, notes for this talk, and more) are available at http://homegwuedu/
More informationOn the Turán number of Triple-Systems
On the Turán number of Triple-Systems Dhruv Mubayi Vojtĕch Rödl June 11, 005 Abstract For a family of r-graphs F, the Turán number ex(n, F is the maximum number of edges in an n vertex r-graph that does
More information