Báo cáo toán học: "ON RAMSEY MINIMAL GRAPHS" doc
Báo cáo toán học: "ON RAMSEY MINIMAL GRAPHS" doc
... 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 ON...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: "Nim-Regularity of Graphs" docx
... is a minimal cover of F by circuits. Lemma 2.6. In order to prove that the DUOCs satisfy property (B) of a Nim-basis, it suffices to show the following: If F is a non-empty face, {D i } is a minimal ... all faces F and minimal covers {D i } of F by circuits, D − F is not a DUOC. Suppose also that there are pairs of DUOCs which differ by a non- empty face. Let A and B,withB ⊆ A, be minimal...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: "Explicit Ramsey graphs and orthonormal labelings" pdf
... significantly. References [1] M.Ajtai,J.Koml´os and E. Szemer´edi, AnoteonRamseynumbers, J. Combinatorial Theory Ser. A 29 (1980), 354-360. [2] N. Alon, Tough Ramsey graphs without short cycles, to appear. [3] N. ... constructive lower bounds for the Ramsey numbers R(3,t), J. Combinatorial Theory Ser. B 57 (1993), 150-155. [6] R. Cleve and P. Dagum, AconstructiveΩ(t 1.26 ) lowerboundforthe...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: "On Extremal Graphs With No Long Paths" docx
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: "All Ramsey numbers r(K3, G) for connected graphs of order 9" pps
... cannot be a Ramsey graph for (K 3 ,H). The Ramsey number r(K 3 ,H)isone more than the maximum order of a Ramsey graph for (K 3 ,H). Note that a maximal triangle-free supergraph of a Ramsey graph ... to generate the Ramsey numbers for all connected graphs of order n with Ramsey number at most r 0 , only the Ramsey numbers of the maximal elements of the subgraph lattice with Rams...
Ngày tải lên: 07/08/2014, 06:22
Báo cáo toán học: "On Minimal Words With Given Subword Complexity." pdf
... #R35 2 1. What is the length of a minimal word of order N? 2. Is there a reasonably efficient algorithm that finds such minimal words? 3. For each order how many minimal words are there? We show ... that finds a minimal word of order n for each n and show that the length of a minimal word of order n is F n + F n+2 for n>1. However, the question of a complete enumeration of all minim...
Ngày tải lên: 07/08/2014, 06:22