On random trees obtained from permutation graphs (Q738839): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OEIS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2473159957 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1406.3958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connected components of a random permutation graph with a given number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degrees in the hasse diagram of the strong Bruhat order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the domination number of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5658104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4769056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of indecomposable permutations with a given number of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation Graphs and Transitive Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The limit distribution of the length of the longest head-run / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitely forcible graphons and permutons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinctness of compositions of an integer: A probabilistic analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Multiplicity of Parts in a Random Composition of a Large Integer / rank
 
Normal rank
Property / cites work
 
Property / cites work: The central limit theorem for dependent random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the number of edges in permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5673640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum degree in a random tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitivity and connectivity of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the height of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A more general central limit theorem for \(m\)-dependent random variables with unbounded \(m\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4443440 / rank
 
Normal rank

Latest revision as of 10:15, 12 July 2024

scientific article
Language Label Description Also known as
English
On random trees obtained from permutation graphs
scientific article

    Statements

    On random trees obtained from permutation graphs (English)
    0 references
    0 references
    0 references
    16 August 2016
    0 references
    permutation graph
    0 references
    permutation tree
    0 references
    indecomposable permutation
    0 references
    diameter
    0 references
    maximum degree
    0 references
    domination number
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references