The size Ramsey number
From MaRDI portal
Publication:1227754
DOI10.1007/BF02018930zbMath0331.05122OpenAlexW2164302265WikidataQ105941609 ScholiaQ105941609MaRDI QIDQ1227754
Paul Erdős, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
Publication date: 1977
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02018930
Related Items
The vertex size-Ramsey number ⋮ Degree Ramsey Numbers of Graphs ⋮ On the size-Ramsey number of grid graphs ⋮ Short proofs for long induced paths ⋮ Remarks on a paper by H. Bielak on size Ramsey numbers ⋮ The size Ramsey number of a complete bipartite graph ⋮ On the minimum degree of minimal Ramsey graphs for multiple colours ⋮ The size‐Ramsey number of trees ⋮ Unnamed Item ⋮ Local \(k\)-colorings of graphs and hypergraphs ⋮ Star-critical Gallai-Ramsey numbers involving the disjoint union of triangles ⋮ Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs ⋮ Coloring number and on-line Ramsey theory for graphs and hypergraphs ⋮ On bounds for size Ramsey numbers of a complete tripartite graph ⋮ Explicit construction of linear sized tolerant networks ⋮ Rolling backwards can move you forward: On embedding problems in sparse expanders ⋮ Star-critical Ramsey number of large cycle and book of different orders ⋮ Note on the multicolour size-Ramsey number for paths ⋮ Degree Ramsey numbers for even cycles ⋮ On the Size-Ramsey Number of Tight Paths ⋮ Packing nearly optimal Ramsey \(R(3,t)\) graphs ⋮ On the restricted size Ramsey number involving a path \(P_3\) ⋮ On the multicolor size Ramsey number of stars and cliques ⋮ Rainbow subgraphs in Hamiltonian cycle decompositions of complete graphs ⋮ The size‐Ramsey number of cubic graphs ⋮ Restricted size Ramsey number for P3 versus dense connected graphs of order six ⋮ Multicolor list Ramsey numbers grow exponentially ⋮ The oriented size Ramsey number of directed paths ⋮ The size‐Ramsey number of short subdivisions ⋮ How Many Conflicts Does It Need to Be Unsatisfiable? ⋮ New upper bounds for Ramsey numbers of books ⋮ Ramsey numbers of large books ⋮ Monochromatic paths in random tournaments ⋮ Off-diagonal book Ramsey numbers ⋮ Connected size Ramsey number for matchings vs. small stars or cycles ⋮ The size Ramsey number of a directed path ⋮ Size Gallai-Ramsey number ⋮ Ramsey Equivalence for Asymmetric Pairs of Graphs ⋮ Star-critical Ramsey numbers ⋮ The Induced Size-Ramsey Number of Cycles ⋮ The multicolour size-Ramsey number of powers of paths ⋮ Sparse partition universal graphs for graphs of bounded degree ⋮ An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths ⋮ Complete bipartite graphs deleted in Ramsey graphs ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Some Ramsey-Turán type problems and related questions ⋮ Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs ⋮ On finite Ramsey numbers ⋮ An analogue of the Erdős-Gallai theorem for random graphs ⋮ Blowup Ramsey numbers ⋮ On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness ⋮ Online Ramsey Numbers and the Subgraph Query Problem ⋮ Some star-critical Ramsey numbers ⋮ The size Ramsey number of short subdivisions of bounded degree graphs ⋮ On-line Ramsey numbers of paths and cycles ⋮ Degree bipartite Ramsey numbers ⋮ Graph properties and hypergraph colourings ⋮ Sparse multipartite graphs as partition universal for graphs with bounded degree ⋮ On multicolour noncomplete Ramsey graphs of star graphs ⋮ Lower bounds of size Ramsey number for graphs with small independence number ⋮ An algorithmic framework for obtaining lower bounds for random Ramsey problems ⋮ Size Ramsey numbers for some regular graphs ⋮ Size Ramsey numbers for some regular graphs ⋮ Explicit construction of linear sized tolerant networks. (Reprint) ⋮ A note on the Size-Ramsey number of long subdivisions of graphs ⋮ Regular pairs in sparse random graphs I ⋮ Size Ramsey number of bipartite graphs and bipartite Ramanujan graphs ⋮ Ramsey numbers of large books and bipartite graphs with small bandwidth ⋮ Improved bounds on the Ramsey number of fans ⋮ On star-critical and upper size Ramsey numbers ⋮ Deleting edges from Ramsey graphs ⋮ Minimal Ramsey graphs on deleting stars for generalized fans and books ⋮ Restricted size Ramsey number for P3 versus cycle ⋮ On the restricted size Ramsey number for P3 versus dense connected graphs ⋮ Size bipartite Ramsey numbers ⋮ A note on on-line Ramsey numbers of stars and paths ⋮ Star-critical Ramsey numbers of generalized fans ⋮ Size Ramsey results for the path of order three ⋮ On edge‐ordered Ramsey numbers ⋮ On the Size-Ramsey Number of Cycles ⋮ Ordered size Ramsey number of paths ⋮ Remarks on the size Ramsey number of graphs ⋮ Size Ramsey Number of Bounded Degree Graphs for Games ⋮ A note on the size Ramsey numbers for matchings versus cycles ⋮ Star-critical Ramsey numbers of wheels versus odd cycles ⋮ The size‐Ramsey number of powers of bounded degree trees ⋮ The Size Ramsey Number of Graphs with Bounded Treewidth ⋮ Size multipartite Ramsey numbers for stripes versus small cycles ⋮ Restricted size Ramsey number for path of order three versus graph of order five ⋮ Size Ramsey numbers involving stars ⋮ Ramsey Numbers Involving Large Books ⋮ Ramsey numbers of books and quasirandomness ⋮ Large Book-Cycle Ramsey Numbers ⋮ The connected size Ramsey number for matchings versus small disconnected graphs ⋮ The multicolor size-Ramsey numbers of cycles ⋮ Ramsey numbers of cycles versus general graphs
Cites Work
This page was built for publication: The size Ramsey number
