The following pages link to Peter Kirschenhofer (Q210450):
Displaying 50 items.
- A Ramanujan sequence that refines the Cayley formula for trees (Q1288802) (← links)
- Geometric tree graphs of points in convex position (Q1289020) (← links)
- Addendum to: The number of winners in a discrete geometrically distributed sample (Q1296748) (← links)
- Independent trees and branchings in planar multigraphs (Q1299999) (← links)
- The Steiner ratio of \({\mathcal L}_{2k}^d\) (Q1302158) (← links)
- A result in order statistics related to probabilistic counting (Q1308501) (← links)
- Mellin transforms and asymptotics: Digital sums (Q1314384) (← links)
- Minors of quasi 4-connected graphs (Q1318814) (← links)
- The existence of infinitely many primary trees (Q1343258) (← links)
- Opinion functions on trees (Q1356450) (← links)
- On spanning 2-trees in a graph (Q1356500) (← links)
- Spanning regular caterpillars in hypercubes (Q1357654) (← links)
- Perfect matchings of polyomino graphs (Q1376069) (← links)
- On the characterization of graphs with maximum number of spanning trees (Q1377718) (← links)
- All trees contain a large induced subgraph having all degrees 1 (mod \(k\)) (Q1377743) (← links)
- Constrained arrangements of objects in a cycle (Q1378360) (← links)
- Subexpansions, superexpansions and uniqueness properties in non-integer bases (Q1397466) (← links)
- Labeling trees with a condition at distance two. (Q1402073) (← links)
- Embedding trees into graphs of large girth (Q1567289) (← links)
- On a class of combinatorial Diophantine equations (Q1595303) (← links)
- Bijections for ternary trees and non-crossing trees (Q1613443) (← links)
- Distribution results on polynomials with bounded roots (Q1744088) (← links)
- Neighborhood subtree tolerance graphs (Q1801665) (← links)
- Tree-width, path-width, and cutwidth (Q1801672) (← links)
- On triangle-partitions. I (Q1814132) (← links)
- The number of winners in a discrete geometrically distributed sample (Q1814758) (← links)
- The properties of random trees (Q1825678) (← links)
- Thue-like sequences and rainbow arithmetic progressions (Q1856338) (← links)
- Combinatorial and arithmetical properties of linear numeration systems (Q1872882) (← links)
- On Ramanujan's \(Q\)-function (Q1894389) (← links)
- The size of \(k\)-pseudotrees (Q1894770) (← links)
- Independent domination in regular graphs (Q1897445) (← links)
- Homogeneous trees are bilipschitz equivalent (Q1900019) (← links)
- An explicit formula of the exponential sums of digital sums (Q1908885) (← links)
- Disproofs of generalized Gilbert-Pollak conjecture on the Steiner ratio in three or more dimensions (Q1914000) (← links)
- Intersection graphs of Helly families of subtrees (Q1917300) (← links)
- A note on alternating sums (Q1918882) (← links)
- Skip lists - some results on a recent data structure (Q1921455) (← links)
- Return statistics of simple random walks (Q1923406) (← links)
- Complexity of tree homomorphisms (Q1923593) (← links)
- Reconstruction of rooted trees from subtrees (Q1923599) (← links)
- Enumeration of (uni- or bicolored) plane trees according to their degree distribution (Q1924370) (← links)
- The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees (Q1962070) (← links)
- New characteristics of some polynomial sequences in combinatorial theory (Q2367777) (← links)
- Discrepancy with respect to convex polygons (Q2465297) (← links)
- On polynomially normal lattice configurations (Q2494358) (← links)
- Diophantine equations between polynomials obeying second order recurrences (Q2567397) (← links)
- Elements of small norm in Shanks' cubic extensions of imaginary quadratic fields (Q2643573) (← links)
- Enumerative combinatorics on words (Q2704225) (← links)
- Complete families of graphs (Q2706951) (← links)
