DM 2000 - PDF Preprint Papers

DM 2000

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed DM-2000 Paper

click to vote

DM
2000

158views more DM 2000»

Bipartite Ramsey numbers and Zarankiewicz numbers

13 years 4 months ago

Download www.cs.clemson.edu

The Zarankiewicz number z(s, m) is the maximum number of edges in a subgraph of K(s, s) that does not contain K(m, m) as a subgraph. The bipartite Ramsey number b(m, n) is the lea...

Wayne Goddard, Michael A. Henning, Ortrud R. Oelle...

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.

Id	Views	Title	Status

1	158	Bipartite Ramsey numbers and Zarankiewicz numbers	claim
2	150	A note on generalized chromatic number and generalized girth	claim
3	130	On a conjecture of Keedwell and the cycle double cover conjecture	claim
4	127	Special formal series solutions of linear operator equations	claim
5	115	Dualizability and graph algebras	claim
6	111	Representations of graphs modulo n	claim
7	111	Congruence of (2×2) matrices	claim
8	108	On completeness of word reversing	claim
9	103	Feasible edge colorings of trees with cardinality constraints	claim
10	100	The congestion of n-cube layout on a rectangular grid	claim
11	99	Chromatically unique bipartite graphs with low 3-independent partition numbers	claim
12	99	Isomorphic factorization of de Bruijn digraphs	claim
13	94	Closure and factor-critical graphs	claim
14	92	Belyi functions for Archimedean solids	claim
15	91	Perfection thickness of graphs	claim
16	91	Three distance theorem and grid graph	claim
17	91	On the number of chord diagrams	claim
18	89	Some counting problems related to permutation groups	claim
19	89	On median graphs and median grid graphs	claim
20	88	Hamiltonian decomposition of recursive circulant graphs	claim
21	88	Edge isoperimetric inequalities for product graphs	claim
22	83	Perfect binary codes: bounds and properties	claim
23	82	On special numberings of hypergraphs	claim
24	81	The optimal pebbling number of the complete m-ary tree	claim
25	81	A determinant property of Catalan numbers	claim
26	80	An attempt to classify bipartite graphs by chromatic polynomials	claim
27	76	Intersection of modules related to Macdonald's polynomials	claim
28	76	Applications of integer relation algorithms	claim
29	76	On the number of ordered factorizations of natural numbers	claim
30	73	Some formulae for partitions into squares	claim
31	73	Frequency-distance constraints with large distances	claim
32	73	Liftings of automorphisms of hypermaps	claim
33	71	Near-MDS codes over some small fields	claim
34	69	An extremal problem on the potentially Pk-graphic sequences	claim
35	66	From Motzkin to Catalan permutations	claim
36	66	The selectope for games with partial cooperation	claim
37	66	Tiling with notched cubes	claim
38	65	Long cycles in 3-cyclable graphs	claim
39	64	Size functions of subgeometry-closed classes of representable combinatorial geometries	claim
40	55	The Extension Theorem	claim
41	49	Extremal properties of ray-nonsingular matrices	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers