Previous work on Ramsey multiplicity focused primarily on the multiplicity of complete graphs of constant size. We study the question for larger complete graphs, specifically showing that in every 2-coloring of a complete graph on @math vertices, there are at least @math monochromatic complete subgraphs of size between @math and @math . We also study bounds on the ratio between a maximum and a random red clique in a graph, and the ratio between a maximum and a random monochromatic clique in a graph.
A survey on Ramsey Multiplicity results was published in 1980 by Burr and Rosta @cite_11 , in which they extend Erd "o s's conjecture to the multiplicity of any subgraph, not just monochromatic complete subgraphs.
@cite_11
2038712425 2295840581 1524397983 2952522043
Ramsey's theorem guarantees that if G is a graph, then any 2-coloring of the edges of a large enough complete graph yields a monochromatic copy of G. Interesting problems arise when one asks how many such G must occur. A survey of this and related problems is given, along with a number of new results. We show an exponential separation between two well-studied models of algebraic computation, namely read-once oblivious algebraic branching programs (ROABPs) and multilinear depth three circuits. In particular we show the following: 1. There exists an explicit n-variate polynomial computable by linear sized multilinear depth three circuits (with only two product gates) such that every ROABP computing it requires 2^ Omega(n) size. 2. Any multilinear depth three circuit computing IMM_ n,d (the iterated matrix multiplication polynomial formed by multiplying d, n * n symbolic matrices) has n^ Omega(d) size. IMM_ n,d can be easily computed by a poly(n,d) sized ROABP. 3. Further, the proof of 2 yields an exponential separation between multilinear depth four and multilinear depth three circuits: There is an explicit n-variate, degree d polynomial computable by a poly(n,d) sized multilinear depth four circuit such that any multilinear depth three circuit computing it has size n^ Omega(d) . This improves upon the quasi-polynomial separation result by Raz and Yehudayoff [2009] between these two models. The hard polynomial in 1 is constructed using a novel application of expander graphs in conjunction with the evaluation dimension measure used previously in Nisan [1991], Raz [2006,2009], Raz and Yehudayoff [2009], and Forbes and Shpilka [2013], while 2 is proved via a new adaptation of the dimension of the partial derivatives measure used by Nisan and Wigderson [1997]. Our lower bounds hold over any field. When graph Ramsey theory is viewed as a game, "Painter" 2-colors the edges of a graph presented by "Builder". Builder wins if every coloring has a monochromatic copy of a fixed graph @math . In the on-line version, iteratively, Builder presents one edge and Painter must color it. Builder must keep the presented graph in a class @math . Builder wins the game @math if a monochromatic copy of @math can be forced. The on-line degree Ramsey number @math is the least @math such that Builder wins @math when @math is the class of graphs with maximum degree at most @math . Our results include: 1) @math if and only if @math is a linear forest or each component lies inside @math . 2) @math , where @math . 3) @math for a tree @math , where @math and @math are two largest vertex degrees. 4) @math , with @math except for finitely many odd values of @math . 5) @math when @math . The lower bounds come from strategies for Painter that color edges red whenever the red graph remains in a specified class. The upper bounds use a result showing that Builder may assume that Painter plays "consistently". Our main theorems provide a single geometric setting in which polynomial representatives for Schubert classes in the integral cohomology ring of the flag manifold are determined uniquely, and have positive coefficients for geometric reasons. This results in a geometric explanation for the naturality of Schubert polynomials and their associated combinatorics. Given a permutation w in S_n, we consider a determinantal ideal I_w whose generators are certain minors in the generic n x n matrix (filled with independent variables). Using multidegrees' as simple algebraic substitutes for torus-equivariant cohomology classes on vector spaces, our main theorems describe, for each ideal I_w: - variously graded multidegrees and Hilbert series in terms of ordinary and double Schubert and Grothendieck polynomials; - a Grobner basis consisting of minors in the generic n x n matrix; - the Stanley-Reisner complex of the initial ideal in terms of known combinatorial diagrams associated to permutations in S_n; and - a procedure inductive on weak Bruhat order for listing the facets of this complex, thereby generating the coefficients of Schubert polynomials by a positive recursion on combinatorial diagrams. We show that the initial ideal is Cohen-Macaulay, by identifying the Stanley-Reisner complex as a special kind of subword complex in S_n'', which we define generally for arbitrary Coxeter groups, and prove to be shellable by giving an explicit vertex decomposition. We also prove geometrically a general positivity statement for multidegrees of subschemes.