Ramsey numbers for bipartite graphs with small bandwidth (Q2346589): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Mathias Schacht / rank
 
Normal rank
Property / author
 
Property / author: Anusch Taraz / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2129686506 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1602.05972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-goodness -- and otherwise / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-colored Ramsey number of even cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding into Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path Ramsey numbers in multicolorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number for a triple of long even cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-color Ramsey numbers for paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tripartite Ramsey numbers for paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number for hypergraph cycles. I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey numbers for trees of small maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic version of the blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(R(C_n,C_n,C_n)\leqq (4+o(1))n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph Packing and Graph Embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank

Latest revision as of 04:42, 10 July 2024

scientific article
Language Label Description Also known as
English
Ramsey numbers for bipartite graphs with small bandwidth
scientific article

    Statements

    Ramsey numbers for bipartite graphs with small bandwidth (English)
    0 references
    0 references
    0 references
    0 references
    2 June 2015
    0 references
    color Ramsey number
    0 references
    grid graphs
    0 references

    Identifiers

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