Bipartite Ramsey numbers of paths for random graphs
From MaRDI portal
Publication:1720323
DOI10.1016/j.dam.2018.06.040zbMath1404.05197OpenAlexW2885353619WikidataQ129396249 ScholiaQ129396249MaRDI QIDQ1720323
Publication date: 8 February 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.06.040
Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparse partition universal graphs for graphs of bounded degree
- The Ramsey number of a graph with bounded maximum degree
- Path-path Ramsey type numbers for the complete bipartite graph
- Sparse multipartite graphs as partition universal for graphs with bounded degree
- Bipartite Ramsey numbers for graphs of small bandwidth
- Tripartite Ramsey numbers for paths
- An extremal problem for paths in bipartite graphs
- Szemerédi’s Regularity Lemma for Sparse Graphs
- An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths
- Path Ramsey Number for Random Graphs
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations