Cycle Lengths in a Permutation are Typically Poisson
نویسندگان
چکیده
منابع مشابه
Cycle Lengths in a Permutation are Typically Poisson
The set of cycle lengths of almost all permutations in Sn are “Poisson distributed”: we show that this remains true even when we restrict the number of cycles in the permutation. The formulas we develop allow us to also show that almost all permutations with a given number of cycles have a certain “normal order” (in the spirit of the Erdős-Turán theorem). Our results were inspired by analogous ...
متن کاملOn the tenacity of cycle permutation graph
A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.
متن کاملA Note on Cycle Lengths in Graphs
We prove that for every c > 0 there exists a constant K = K(c) such that every graph G with n vertices and minimum degree at least cn contains a cycle of length t for every even t in the interval [4, ec(G)−K] and every odd t in the interval [K, oc(G)−K], where ec(G) and oc(G) denote the length of the longest even cycle in G and the longest odd cycle in G respectively. We also give a rough estim...
متن کاملCycle lengths in sparse graphs
Let C(G) denote the set of lengths of cycles in a graph G. In the first part of this paper, we study the minimum possible value of |C(G)| over all graphs G of average degree d and girth g. Erdős [7] conjectured that |C(G)| = Ω ( d ) for all such graphs, and we prove this conjecture. We also show that this is a lower bound for the number of odd cycle lengths in a graph of chromatic number d and ...
متن کاملon the tenacity of cycle permutation graph
a special class of cubic graphs are the cycle permutation graphs. a cycle permutation graph pn( α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.in this paper we determine a good upper bound for tenacity of cycle permutation graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2006
ISSN: 1077-8926
DOI: 10.37236/1133