The size‐Ramsey number of powers of bounded degree trees (Q5006327): 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: 1907.03466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit construction of linear sized tolerant networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On size Ramsey number of paths, trees, and circuits. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3728934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size‐Ramsey number of powers of paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent developments in graph Ramsey theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size‐Ramsey number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on tree decomposition of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some Multicolor Ramsey Properties of Random Graphs / 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: The size Ramsey number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanding graphs contain all small trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multicolour size-Ramsey number of powers of paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size-Ramsey number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Induced Size-Ramsey Number of Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent developments on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size Ramsey number of trees with bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size Ramsey number of short subdivisions of bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse partition universal graphs for graphs of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of K. Zarankiewicz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles in locally expanding graphs, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path Ramsey Number for Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating Ramsey Numbers by Partitioning Colored Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey goodness of paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey Goodness of Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On size Ramsey numbers of graphs with bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tree-partition-width / rank
 
Normal rank

Latest revision as of 09:24, 26 July 2024

scientific article; zbMATH DE number 7381838
Language Label Description Also known as
English
The size‐Ramsey number of powers of bounded degree trees
scientific article; zbMATH DE number 7381838

    Statements

    The size‐Ramsey number of powers of bounded degree trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 August 2021
    0 references
    \(s\)-colour size-Ramsey number
    0 references
    partition universal graphs
    0 references
    bounded treewidth graphs
    0 references
    random graphs
    0 references
    pseudorandom graphs
    0 references
    0 references
    0 references
    0 references

    Identifiers

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