JCT 2010 - PDF Preprint Papers

JCT 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JCT-2010 Paper

click to vote

JCT
2010

158views more JCT 2010»

An asymptotic solution to the cycle decomposition problem for complete graphs

13 years 10 months ago

Download www.maths.uq.edu.au

Let m1, m2, . . . , mt be a list of integers. It is shown that there exists an integer N such that for all n ≥ N, the complete graph of order n can be decomposed into edge-disjo...

Darryn E. Bryant, Daniel Horsley

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	An asymptotic solution to the cycle decomposition problem for complete graphs	claim
2	144	Combinatorics of generalized q-Euler numbers	claim
3	135	Countable connected-homogeneous graphs	claim
4	127	On the density of a graph and its blowup	claim
5	118	Combinatorics on partial word correlations	claim
6	117	(2+2)-free posets, ascent sequences and pattern avoiding permutations	claim
7	114	An almost quadratic bound on vertex Folkman numbers	claim
8	113	Equations resolving a conjecture of Rado on partition regularity	claim
9	112	Annular embeddings of permutations for arbitrary genus	claim
10	112	More on block intersection polynomials and new applications to graphs and block designs	claim
11	111	Anti-Ramsey properties of random graphs	claim
12	110	Pancyclicity of Hamiltonian and highly connected graphs	claim
13	109	Avoider-Enforcer: The rules of the game	claim
14	102	Coloring axis-parallel rectangles	claim
15	101	Asymptotically optimal frugal colouring	claim
16	98	Lifts of matroid representations over partial fields	claim
17	95	Oriented diameter of graphs with diameter 3	claim
18	94	Growth diagrams for the Schubert multiplication	claim
19	93	Ramanujan's lost notebook: Combinatorial proofs of identities associated with Heine's transformation or partial theta functions	claim
20	93	On cross t-intersecting families of sets	claim
21	92	Enumeration by kernel positions for strongly Bernoulli type truncation games on words	claim
22	91	Lattice path matroids: The excluded minors	claim
23	87	Bijections between pattern-avoiding fillings of Young diagrams	claim
24	85	On inequivalent representations of matroids over non-prime fields	claim
25	85	Symmetric bilinear forms over finite fields of even characteristic	claim
26	83	Families of prudent self-avoiding walks	claim
27	82	Major index for 01-fillings of moon polyominoes	claim
28	81	q-Partition algebra combinatorics	claim
29	81	On the probability of a rational outcome for generalized social welfare functions on three alternatives	claim
30	80	Flag enumerations of matroid base polytopes	claim
31	80	Shadows and intersections in vector spaces	claim
32	79	Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture	claim
33	79	Confinement of matroid representations to subsets of partial fields	claim
34	77	Obtainable sizes of topologies on finite sets	claim
35	75	Hamiltonian degree sequences in digraphs	claim
36	75	Spectral radius of finite and infinite planar graphs and of graphs of bounded genus	claim
37	75	A combinatorial approach to the power of 2 in the number of involutions	claim
38	74	Claw-free graphs VI. Colouring	claim
39	72	Extensions and restrictions of Wythoff's game preserving its p positions	claim
40	71	A multilinear operator for almost product evaluation of Hankel determinants	claim
41	71	Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture	claim
42	70	Graphs with bounded tree-width and large odd-girth are almost bipartite	claim
43	68	Dirac-type results for loose Hamilton cycles in uniform hypergraphs	claim
44	67	Dual graph homomorphism functions	claim
45	67	On finite edge-primitive and edge-quasiprimitive graphs	claim
46	66	On fixed point sets of distinguished collections for groups of parabolic characteristic	claim
47	65	Multiple cross-intersecting families of signed sets	claim
48	65	Circular edge-colorings of cubic graphs with girth six	claim
49	65	Cycle covers (I) - Minimal contra pairs and Hamilton weights	claim
50	64	A new source of seed pairs for Golay sequences of length 2m	claim
51	64	Eigenvalues of the derangement graph	claim
52	63	Cyclic sieving, promotion, and representation theory	claim
53	63	Counting numerical sets with no small atoms	claim
54	63	Cross-intersecting families of permutations	claim
55	63	Small graph classes and bounded expansion	claim
56	62	A Ramsey theorem for structures with both relations and functions	claim
57	61	The projective plane is a stabilizer	claim
58	59	The number of points in a matroid with no n-point line as a minor	claim
59	58	Algebraic shifting of strongly edge decomposable spheres	claim
60	58	Map operations and k-orbit maps	claim
61	58	Cycles of given length in oriented graphs	claim
62	56	Growth constants of minor-closed classes of graphs	claim
63	56	Crossing-critical graphs with large maximum degree	claim
64	55	The necklace poset is a symmetric chain order	claim
65	54	Traceability codes	claim
66	51	Pattern avoidance in binary trees	claim
67	51	Interval partitions and Stanley depth	claim
68	51	Graph minors XXIII. Nash-Williams' immersion conjecture	claim
69	50	Tight embeddings of partial quadrilateral packings	claim
70	46	Irreducible triangulations are small	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers