JCT 2006 - PDF Preprint Papers

JCT 2006

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JCT-2006 Paper

click to vote

JCT
2006

168views more JCT 2006»

Mono-multi bipartite Ramsey numbers, designs, and matrices

13 years 4 months ago

Download www.users.muohio.edu

Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2....

Paul N. Balister, András Gyárf&aacut...

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	168	Mono-multi bipartite Ramsey numbers, designs, and matrices	claim
2	134	MacLane's planarity criterion for locally finite graphs	claim
3	129	A combinatorial proof of the Rogers-Ramanujan and Schur identities	claim
4	110	Branch-width, parse trees, and monadic second-order logic for matroids	claim
5	109	On the combinatorial invariance of Kazhdan-Lusztig polynomials	claim
6	108	Jack van Lint (1932-2004): A survey of his scientific work	claim
7	102	Minimal bricks	claim
8	102	Hamiltonicity in 3-connected claw-free graphs	claim
9	100	On 3-colorable plane graphs without 5- and 7-cycles	claim
10	100	Approximating clique-width and branch-width	claim
11	100	Enumeration of unrooted maps of a given genus	claim
12	93	On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs	claim
13	93	Dominating sets in k-majority tournaments	claim
14	92	Classification of small (0, 2)-graphs	claim
15	89	Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums	claim
16	89	Revlex-initial 0/1-polytopes	claim
17	88	Multiplicative structures in additively large sets	claim
18	87	Construction of bent functions via Niho power functions	claim
19	83	The mathematics of Bruce Rothschild	claim
20	83	Construction of asymmetric connectors of depth two	claim
21	82	On Rado's Boundedness Conjecture	claim
22	82	A symmetric Roos bound for linear codes	claim
23	81	Cycle double covers and spanning minors I	claim
24	81	Independent sets in triangle-free cubic planar graphs	claim
25	81	Constructions of generalized Sidon sets	claim
26	81	New identities involving Bernoulli and Euler polynomials	claim
27	81	Hyperplane partitions and difference systems of sets	claim
28	80	Extending precolorings to circular colorings	claim
29	79	A class of perfectly contractile graphs	claim
30	79	Reciprocity for multirestricted Stirling numbers	claim
31	79	A characterization of cocircuit graphs of uniform oriented matroids	claim
32	77	There are uncountably many topological types of locally finite trees	claim
33	75	New polytopes from products	claim
34	75	Sperner labellings: A combinatorial approach	claim
35	73	Colouring lines in projective space	claim
36	72	On the work of Basil Gordon	claim
37	72	Arboricity and tree-packing in locally finite graphs	claim
38	72	Partial flocks of the quadratic cone	claim
39	71	On the extreme eigenvalues of regular graphs	claim
40	70	Sparse halves in triangle-free graphs	claim
41	69	The Bergman complex of a matroid and phylogenetic trees	claim
42	69	The Ramsey number for hypergraph cycles I	claim
43	69	Short paths in quasi-random triple systems with sparse underlying graphs	claim
44	68	An improved bound for the monochromatic cycle partition number	claim
45	67	On the coexistence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs	claim
46	66	Rank 3 Latin square designs	claim
47	64	Inequalities between Littlewood-Richardson coefficients	claim
48	64	Every 3-connected, essentially 11-connected line graph is Hamiltonian	claim
49	62	On Rota's conjecture and excluded minors containing large projective geometries	claim
50	60	Alternating sign matrices with one -1 under vertical reflection	claim
51	60	A simple proof of Graham and Pollak's theorem	claim
52	60	On the number of rectangulations of a planar point set	claim
53	60	Mutually embeddable graphs and the tree alternative conjecture	claim
54	59	Intersection theorems under dimension constraints	claim
55	59	Covering an ellipsoid with equal balls	claim
56	55	A proof of the q, t-square conjecture	claim
57	54	Spectral estimates for Abelian Cayley graphs	claim
58	54	Matroid packing and covering with circuits through an element	claim
59	54	Haruspicy 3: The anisotropic generating function of directed bond-animals is not D-finite	claim
60	54	The Steiner quadruple systems of order 16	claim
61	53	On the number of factorizations of a full cycle	claim
62	53	Disturbing the Dyson conjecture, in a generally GOOD way	claim
63	52	Further combinatorial constructions for optimal frequency-hopping sequences	claim
64	51	Left cells containing a fully commutative element	claim
65	49	On the integrality of nth roots of generating functions	claim
66	48	Limits of dense graph sequences	claim
67	47	A map colour theorem for the union of graphs	claim
68	46	Optimal tristance anticodes in certain graphs	claim
69	46	Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite	claim
70	46	Combinatorial interpretations of the q-Faulhaber and q-Salié coefficients	claim
71	45	A family of skew Hadamard difference sets	claim
72	44	On central difference sets in certain non-abelian 2-groups	claim
73	44	Intersections of Leray complexes and regularity of monomial ideals	claim
74	44	Obstructions to branch-decomposition of matroids	claim
75	43	On a restricted cross-intersection problem	claim
76	43	On the expansion rate of Margulis expanders	claim
77	40	Erdos-Ko-Rado for three sets	claim
78	37	An L-system on the small Witt design	claim
79	36	A linear programming formulation of Mader's edge-disjoint paths problem	claim
80	35	On the classification of all self-dual additive codes over GF(4) of length up to 12	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers