JCT 2007 - PDF Preprint Papers

JCT 2007

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JCT-2007 Paper

click to vote

JCT
2007

150views more JCT 2007»

On the degree distribution of the nodes in increasing trees

14 years 14 days ago

Download info.tuwien.ac.at

Abstract. Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i.e.,...

Markus Kuba, Alois Panholzer

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	150	On the degree distribution of the nodes in increasing trees	claim
2	149	Weighted forms of Euler's theorem	claim
3	146	Laplacian spectral bounds for clique and independence numbers of graphs	claim
4	142	Graphs that triangulate a given surface and quadrangulate another surface	claim
5	141	Partition identities and Ramanujan's modular equations	claim
6	140	Homomorphisms and edge-colourings of planar graphs	claim
7	134	Improved Delsarte bounds for spherical codes in small dimensions	claim
8	133	Biased graphs. VII. Contrabalance and antivoltages	claim
9	122	h-Vectors of Gorenstein polytopes	claim
10	119	Cliques and the spectral radius	claim
11	118	Excluding a planar graph from GF(q)-representable matroids	claim
12	117	Large independent sets in regular graphs of large girth	claim
13	112	On generalized Kneser hypergraph colorings	claim
14	112	Bruhat intervals as rooks on skew Ferrers boards	claim
15	111	Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements	claim
16	111	Removing even crossings	claim
17	110	Bijective counting of Kreweras walks and loopless triangulations	claim
18	108	The cover time of the preferential attachment graph	claim
19	107	Vertex-minors, monadic second-order logic, and a conjecture by Seese	claim
20	107	On a conjecture of Wilf	claim
21	107	Independent transversals in locally sparse graphs	claim
22	103	Geometric drawings of Kn with few crossings	claim
23	99	Independence for partition regular equations	claim
24	98	Triangular embeddings of complete graphs from graceful labellings of paths	claim
25	97	What power of two divides a weighted Catalan number?	claim
26	96	On the chromatic number and independence number of hypergraph products	claim
27	96	Co-degree density of hypergraphs	claim
28	96	Induced subgraphs of Ramsey graphs with many distinct degrees	claim
29	95	Codegree problems for projective geometries	claim
30	95	Directed tree-width examples	claim
31	94	A zero-free interval for flow polynomials of cubic graphs	claim
32	94	A bijection between 2-triangulations and pairs of non-crossing Dyck paths	claim
33	93	The circular chromatic index of graphs of high girth	claim
34	93	Generating bricks	claim
35	92	Minimal non-orientable matroids in a projective plane	claim
36	90	Enumeration problems for classes of self-similar graphs	claim
37	90	Elliptic enumeration of nonintersecting lattice paths	claim
38	90	On the maximum number of edges in quasi-planar graphs	claim
39	90	Overpartitions, lattice paths, and Rogers-Ramanujan identities	claim
40	85	Separating systems and oriented graphs of diameter two	claim
41	85	Avoider-Enforcer games	claim
42	85	Irreducible collineation groups with two orbits forming an oval	claim
43	84	Universal graphs with a forbidden subtree	claim
44	84	Shelling the coset poset	claim
45	83	On 6-sparse Steiner triple systems	claim
46	83	A finiteness theorem for Markov bases of hierarchical models	claim
47	83	On the largest eigenvalue of non-regular graphs	claim
48	82	A new generalization of Mantel's theorem to k-graphs	claim
49	79	Generalization of Stanley's monster reciprocity theorem	claim
50	78	Semisymmetric graphs from polytopes	claim
51	78	Projective-planar signed graphs and tangled signed graphs	claim
52	77	Exponentially many 5-list-colorings of planar graphs	claim
53	76	The branchwidth of graphs and their cycle matroids	claim
54	76	Perfect matchings extend to Hamilton cycles in hypercubes	claim
55	74	Linear algebra approach to geometric graphs	claim
56	73	Claw-free graphs. I. Orientable prismatic graphs	claim
57	71	Divisibility of generalized Catalan numbers	claim
58	70	Integrals, partitions and MacMahon's Theorem	claim
59	69	Amalgamations of factorizations of complete graphs	claim
60	68	Testing branch-width	claim
61	67	Extreme eigenvalues of nonregular graphs	claim
62	67	Combinatorics of normal sequences of braids	claim
63	65	Paths with two blocks in n-chromatic digraphs	claim
64	64	Standard tableaux and Klyachko's theorem on Lie representations	claim
65	64	The roots of the independence polynomial of a clawfree graph	claim
66	64	Distance-regular Cayley graphs on dihedral groups	claim
67	63	Multiply-intersecting families revisited	claim
68	62	Integer and fractional packings of hypergraphs	claim
69	62	Relaxed two-coloring of cubic graphs	claim
70	56	Pattern avoidance and the Bruhat order	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers