EJC 2006 - PDF Preprint Papers

EJC 2006

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed EJC-2006 Paper

click to vote

EJC
2006

152views Information Technology» more EJC 2006»

A note on Ramsey numbers with two parameters

13 years 11 months ago

Download math.nju.edu.cn

1 The Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertices2 either G contains G1 or G contains G2, where G denotes the complement of G. In this...

Yi Ru Huang, Jian Sheng Yang, Kemin Zhang

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Related Conferences

Id	Views	Title	Status

1	152	A note on Ramsey numbers with two parameters	claim
2	151	Ontology based Text Annotation - OnTeA	claim
3	126	3-star factors in random d-regular graphs	claim
4	124	On the canonical metric representation, average distance, and partial Hamming graphs	claim
5	119	Antisymmetric flows in matroids	claim
6	116	Ontological Queries Supporting Decision Process in KaSeA System	claim
7	111	The topology of the independence complex	claim
8	109	Symplectic graphs and their automorphisms	claim
9	104	Perfect matchings in uniform hypergraphs with large minimum degree	claim
10	101	Poset edge-labellings and left modularity	claim
11	100	An iterative-bijective approach to generalizations of Schur's theorem	claim
12	99	Hadamard ideals and Hadamard matrices with two circulant cores	claim
13	99	Eulerian colorings and the bipartizing matchings conjecture of Fleischner	claim
14	99	Product representations of polynomials	claim
15	95	Improving diameter bounds for distance-regular graphs	claim
16	95	Generalized wreath products of association schemes	claim
17	95	Group connectivity of graphs with diameter at most 2	claim
18	93	The rank of connection matrices and the dimension of graph algebras	claim
19	93	Hamilton cycles in random lifts of graphs	claim
20	92	Treating Quantifiers in Database Semantics	claim
21	92	The positive Bergman complex of an oriented matroid	claim
22	92	Deza digraphs	claim
23	92	Matroid tree-width	claim
24	91	Counting connected graphs asymptotically	claim
25	89	Tracing a single user	claim
26	88	Business Process Modeling	claim
27	87	Recouvrements Hamiltoniens de certains graphes	claim
28	86	Homogeneous factorisations of graphs and digraphs	claim
29	86	A construction for non-rank facets of stable set polytopes of webs	claim
30	85	Two oiseau decompositions of permutations and their application to Eulerian calculus	claim
31	84	A note on the Hopf-Stiefel function	claim
32	82	On the diameter of separated point sets with many nearly equal distances	claim
33	81	Tubes in PG(3, q)	claim
34	81	Homomorphism bounded classes of graphs	claim
35	80	Old and young leaves on plane trees	claim
36	80	The independence numbers of fullerenes and benzenoids	claim
37	80	Hamiltonicity of digraphs for universal cycles of permutations	claim
38	78	Parity reversing involutions on plane trees and 2-Motzkin paths	claim
39	78	Pairwise intersections and forbidden configurations	claim
40	78	On constructive characterizations of (k, l)-sparse graphs	claim
41	77	Invariant subspaces, duality, and covers of the Petersen graph	claim
42	71	Some arithmetic properties of the q-Euler numbers and q-Salié numbers	claim
43	66	Toward the classification of Moufang loops of order 64	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers