Exact Largest and Smallest Size of Components

Algorithmica (Impact Factor: 0.49). 01/2001; 31(3):413-432. DOI: 10.1007/s00453-001-0047-1
Source: DBLP

ABSTRACT Golomb and Gaal [15] study the number of permutations on n objects with largest cycle length equal to k . They give explicit expressions on ranges n/(i+1) < k ≤ n/i for i=1,2, \ldots, derive a general recurrence for the number of permutations of size n with largest cycle length equal to k , and provide the contribution of the ranges (n/(i+1),n/i] for i=1,2,\ldots, to the expected length of the largest cycle.

We view a cycle of a permutation as a component. We provide exact counts for the number of decomposable combinatorial structures
with largest and smallest components of a given size. These structures include permutations, polynomials over finite fields,
and graphs among many others (in both the labelled and unlabelled cases). The contribution of the ranges (n/(i+1),n/i] for i=1,2,\ldots, to the expected length of the smallest and largest component is also studied.

Key words. Largest and smallest components, Random decomposable combinatorial structures, Exponential class.

  • [Show abstract] [Hide abstract]
    ABSTRACT: Not Available
    Foundations of Computer Science, 1981. SFCS '81. 22nd Annual Symposium on; 11/1981
  • Discrete Mathematics - DM. 01/1975;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper begins with the observation that half of all graphs containing no induced path of length 3 are disconnected. We generalize this in several directions. First, we give necessary and sufficient conditions (in terms of generating functions) for the probability of connectedness in a suitable class of graphs to tend to a limit strictly between zero and one. Next we give a general framework in which this and related questions can be posed, involving operations on classes of finite structures. Finally, we discuss briefly an algebra associated with such a class of structures, and give a conjecture about its structure. 1 1 Introduction The class of graphs containing no induced path of length 3 has many remarkable properties, stemming from the following well-known observation. Recall that an induced subgraph of a graph consists of a subset S of the vertex set together with all edges contained in S. Proposition 1.1 Let G be a finite graph with more than one vertex, containin...
    Combinatorics Probability and Computing 06/1998; · 0.61 Impact Factor

Full-text (2 Sources)

Available from
Jun 10, 2014