Báo cáo toán học: "All Ramsey numbers r(K3, G) for connected graphs of order 9" pps

Ngày tải lên: 07/08/2014, 05:23

... C.C.Rousseau and R.H.Schelp, Ramsey minimal graphs for star forests, Discrete Math. 33 (1981), 227–237. [4] S.A.Burr, P.Erd˝os, R.J.Faudree, C.C.Rousseau and R.H.Schelp, Ramsey minimal graphs for match- ings,inThe ... Threshold functions for Ramsey properties,submitted. Key words and phrases: critical graphs, Ramsey theory 1991 Mathematics Subject Classifications: 05D10, 05C80 4 O...

Ngày tải lên: 07/08/2014, 06:20

... is Ω(m 4/3 ). Here we improve this bound and describe an explicit construction of triangle free graphs with independence numbers m and Ω(m 3/2 ) vertices. Our graphs are Cayley graphs and their construc- tion ... Tough Ramsey graphs without short cycles, to appear. [3] N. Alon and N. Kahale, in preparation. [4] N. Alon and J. H. Spencer, The Probabilistic Method, Wiley, 19...

Ngày tải lên: 07/08/2014, 06:20

... number of descendants and ascendants in random search trees. In preparation, 1996. DESCENDANTS IN HEAP ORDERED TREES OR A TRIUMPH OF COMPUTER ALGEBRA Helmut Prodinger Institut făur Algebra und ... and myself are currently investigating this parameter (and several others) for binary search trees and some variants. For more information about heap ordered tre...

Ngày tải lên: 07/08/2014, 06:20

... 1998 Abstract We determine the Ramsey numbers r(K 3 ,G) for all 261080 connected graphs of order 9 and further Ramsey numbers of this type for some graphs of order up to 12. Almost all of them were determined ... containing triangle-free graphs of order r which are (or might be) Ramsey graphs for (K 3 ,H) the electronic journal of combinatorics 5...

Ngày tải lên: 07/08/2014, 06:22

... 07 932- 0971, USA Submitted: April 9, 1998; Accepted: April 13, 1998 ABSTRACT An elementary construction using binary codes gives new record kissing numbers in dimensions from 32 to 128. 1. Introduction Let ... 1,260,230,400 in dimensions 32, 64 and 128, for example). In contrast, Quebbemann’s lattice Q 32 [14], [5, Chap. 8] has τ = 261,120. In recent years the kissing...

Ngày tải lên: 07/08/2014, 06:22

... a given pattern Richard Arratia Department of Mathematics University of Southern California Los Angeles, CA 90089-1113 email: rarratia@math.usc.edu Submitted: July 27, 1999; Accepted: August 25, ... 1999. Abstract. Consider, for a permutation σ ∈S k ,thenumberF(n, σ) of permuta- tions in S n which avoid σ as a subpattern. The conjecture of Stanley and Wilf is that for...

Ngày tải lên: 07/08/2014, 06:22

... Janos Bolyai Mathematical Society, 30–32. [2] T. Banakh. On a cardinal group invariant related to partitions of Abelian groups (in Russian). Mat. Zametki, 64(3):341–350, 1998. English translation ... Russian). Izvestiya Ross. Akad. Nauk, Ser. Mat. (Russian Academy of Sciences. Izvestiya. Mathematics), 2000, to appear. [6] E. R. Berlekamp. A construction of partitions which avoid lon...

Ngày tải lên: 07/08/2014, 06:22

... 1-factors of G. This gives a decomposition of the edges of G into 2r 1-factors of G,a(k + 1) -regular simple graph, and (r − 1) k -regular simple graphs. 3 1-factorization of regular multigraphs of even ... , r 2  are Hamilton cycles of G, F 1 ,F 2 , ,F (r−1) are 1-factors of G, F is a simple (k +1)-factor of G,andS 1 ,S 2 , ,S (r−1) are k -regular simple...

Ngày tải lên: 07/08/2014, 06:22

... factorisation of Motzkin paths. 2.1 Motzkin Paths with Vertex-visits Motzkin paths may be factored recursively in terms of shorter Motzkin paths. In particu- lar, every adsorbing Motzkin path is either ... model of an adsorbing polymer can be defined by letting the path be attracted to an adsorbing line. In models of Motzkin paths, the adsorbing line will be the...

Ngày tải lên: 07/08/2014, 06:23

... his thesis the circular arrangement problem for the hypercube, and Bezrukov and Schroeder [1], who showed that for trees the solutions for the linear arrangement problem and the circular arrangement ... bound for the usual linear arrangement problem. Recall that the linear arrangement problem requires the placement of the vertices of the graph in...

Ngày tải lên: 07/08/2014, 08:22

... Section 2 we construct our main tools to study the Erd˝os problem over finite Euclidean and non -Euclidean spaces, the finite Eu- clidean and non -Euclidean graphs. Our construction follows one of Bannai, ... concise, we will restrict our discussion to the finite non- Euclidean graphs obtained from the action of the simple orthogonal group on the set of non-isotropic p...

Ngày tải lên: 07/08/2014, 15:22

... p l } and we join vertices x and the electronic journal of combinatorics 15 (2008), #R126 10 The Ramsey number of diamond-matchings and loose cycles in hypergraphs Andr´as Gy´arf´as ∗ Computer and ... [12]) and t = 2 (Alon and Frankl [1] and Gy´arf´as [13]). Next we state and prove the Ramsey- type form of our main result, it determines the exact value of...

Ngày tải lên: 07/08/2014, 21:20

... 8 Anti-Ramsey numbers for graphs with independent cycles Zemin Jin Department of Mathematics, Zhejiang Normal University Jinhua 321004, P.R. China zeminjin@hotmail.com Xueliang Li Center for ... of anti-Ramsey numbers for Ω k Unlike graphs in the family Ω 2 , we have no more information about graphs in the family Ω k for k ≥ 3. So we cannot treat the family Ω k...

Ngày tải lên: 08/08/2014, 01:20

... 10.1]. 6.1 Cyclic sieving phenomenon in other types of graphs In [3], one finds various formulas f or counting classes of non-crossing graphs, of which (1) is one. Consider the following four generating ... let C be the cyclic g roup of order n acting on X by rotation. Then (X, X(q), C) exhibits the cyclic sieving phenomen o n. 6.2 Unifying algebraic proof of cyclic sievin...

Ngày tải lên: 08/08/2014, 12:23