Most edge‐orderings of <i>K</i><sub><i>n</i></sub> have maximal altitude (Q5381056): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962680010 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1605.07204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems and results in extremal combinatorics. I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3503433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Combinatorial Theorems on Monotonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Caterpillar arboricity of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing paths in edge ordered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Asymptotic Distribution of Runs of Consecutive Elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding monotone paths in edge-ordered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing Hamiltonian paths in random edge orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Altitude of regular graphs with girth at least five / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone paths in edge-ordered sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Stein's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing paths in edge-ordered graphs: the hypercube and random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Method for constructing Stieltjes classes for \(M\)-indeterminate probability distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Runs of Consecutive Elements / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:22, 19 July 2024

scientific article; zbMATH DE number 7063918
Language Label Description Also known as
English
Most edge‐orderings of <i>K</i><sub><i>n</i></sub> have maximal altitude
scientific article; zbMATH DE number 7063918

    Statements

    Most edge‐orderings of <i>K</i><sub><i>n</i></sub> have maximal altitude (English)
    0 references
    0 references
    7 June 2019
    0 references
    edge orderings
    0 references
    Hamiltonian paths
    0 references
    random graphs
    0 references
    size bias
    0 references
    third moment
    0 references

    Identifiers