The cycle lemma and some applications
From MaRDI portal
Publication:751658
DOI10.1016/S0195-6698(13)80053-4zbMATH Open0715.05004OpenAlexW2090215490WikidataQ106200385 ScholiaQ106200385MaRDI QIDQ751658FDOQ751658
Authors: Nachum Dershowitz, Shmuel Zaks 
Publication date: 1990
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(13)80053-4
Recommendations
- scientific article; zbMATH DE number 3922695
- scientific article; zbMATH DE number 475603
- scientific article; zbMATH DE number 806597
- Cycle Lemma, parking functions and related multigraphs
- scientific article; zbMATH DE number 2230038
- Cycles in bipartite graphs and an application in number theory
- A moving lemma for cycles with very ample modulus
- Publication:3469120
- Cycles in graphs and functional inequalities
- A new proof of a theorem on long cycles
Cites Work
- Title not available (Why is that?)
- A problem of arrangements
- Title not available (Why is that?)
- A Combinatorial Lemma and Its Application to Probability Theory
- Functional Composition Patterns and Power Series Reversion
- The average height of binary trees and other simple trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Altitude of Nodes in Random Trees
- Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
- Title not available (Why is that?)
- On generalised Catalan numbers
- Some Word-Problems
- Title not available (Why is that?)
- Correspondences between plane trees and binary sequences
- A combinatorial proof of the multivariable Lagrange inversion formula
- Some Aspects of the Random Sequence
- Title not available (Why is that?)
- Terms and cyclic permutations
- Title not available (Why is that?)
- A transformation on ordered trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Elementary Evaluation of the Catalan Numbers
Cited In (35)
- A symmetric variation of a distribution of Kreweras and Poupard
- Scaling limits of slim and fat trees
- A parallel algorithm for the generation of a permutation and applications
- A cyclic approach on classical ruin model
- Controlled non-uniform random generation of decomposable structures
- Lattice path moments by cut and paste
- The corners of core partitions
- Generic classification and asymptotic enumeration of dope matrices
- Title not available (Why is that?)
- An equipartition property for the distribution of multiset permutation inversions
- Building uniformly random subtrees
- Multivariate Fuss-Catalan numbers
- Enumeration of connected Catalan objects by type
- The concept of \(q\)-cycle and applications
- Raney and Catalan
- Bijections for faces of the Shi and Catalan arrangements
- Down-step statistics in generalized Dyck paths
- A linear-time algorithm for the generation of trees
- Exact-Size Sampling of Enriched Trees in Linear Time
- Infinite Sperner's theorem
- A cycle lemma for permutation inversions
- Lagrange inversion and Schur functions
- Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs
- Bounded affine permutations I. Pattern avoidance and enumeration
- Partitions of \(\mathbb Z_n\) into arithmetic progressions
- On directed lattice paths with vertical steps
- The butterfly decomposition of plane trees
- Refined Chung-Feller theorems for lattice paths
- Patterns in trees
- On the combinatorics of derangements and related permutations
- On 1-factorizations of bipartite Kneser graphs
- The non-commutative cycle lemma
- The Bohnenblust-Spitzer algorithm and its applications
- Combinatorics of diagonally convex directed polyominoes
- Nonleaf Patterns in Trees: Protected Nodes and Fine Numbers
This page was built for publication: The cycle lemma and some applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751658)
