Nearly-linear monotone paths in edge-ordered graphs (Q2200054): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1809.01468 / 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: Problems and results in extremal combinatorics. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular subgraphs of almost regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Nearly Regular Induced Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long Monotone Trails in Random Edge-Labellings of Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4907706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4659594 / 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: Q4681992 / 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: Q5272625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some extremal problems in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combinatorial problems which I would most like to see solved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing 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: Most edge‐orderings of <i>K</i><sub><i>n</i></sub> have maximal altitude / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone paths in dense edge-ordered graphs / 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: Regular subgraphs of dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense graphs without 3-regular subgraphs / 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: Large monotone paths in graphs with bounded degree / rank
 
Normal rank

Latest revision as of 15:20, 23 July 2024

scientific article
Language Label Description Also known as
English
Nearly-linear monotone paths in edge-ordered graphs
scientific article

    Statements

    Nearly-linear monotone paths in edge-ordered graphs (English)
    0 references
    0 references
    15 September 2020
    0 references

    Identifiers