scientific article

zbMATH Open0316.05110MaRDI QIDQ4075489FDOQ4075489

P. Erdős, Stefan A. Burr

Publication date: 1975

Title of this publication is not available (Why is that?)

Recommendations

• On generalized Ramsey numbers for trees
• scientific article
• scientific article; zbMATH DE number 426333
• Ramsey numbers for sets of small graphs
• scientific article; zbMATH DE number 3520447

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cited In (37)

• What can we hope to accomplish in generalized Ramsey theory ?
• Ramsey numbers for multiple copies of sparse graphs
• A remark on the Ramsey number of the hypercube
• Fraternal augmentations, arrangeability and linear Ramsey numbers
• Two remarks on the Burr-Erdős conjecture
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• On Ramsey numbers of hedgehogs
• Generalized Ramsey theory and decomposable properties of graphs
• Online parameterized dictionary matching with one gap
• Planar graphs have two-coloring number at most 8
• On Ramsey numbers of uniform hypergraphs with given maximum degree
• Monochromatic bounded degree subgraph partitions
• Generalized split graphs and Ramsey numbers
• Some Ramsey-Turán type problems and related questions
• Tower Gaps in Multicolour Ramsey Numbers
• Monochromatic trees in random tournaments
• Covering 2‐colored complete digraphs by monochromatic d $d$‐dominating digraphs
• On the multicolor Ramsey number of a graph with \(m\) edges
• Short proofs of some extremal results. II.
• Ramsey numbers of sparse digraphs
• On the subgraph query problem
• Induced Ramsey-type theorems
• Ramsey numbers of sparse hypergraphs
• The Ramsey number of a graph with bounded maximum degree
• The tail is cut for Ramsey numbers of cubes
• Ramsey number of 1-subdivisions of transitive tournaments
• Ramsey numbers of cubes versus cliques
• Ramsey linear families and generalized subdivided graphs
• A conjecture of Erdős on graph Ramsey numbers
• Ramsey numbers for sparse graphs
• Linear Ramsey Numbers for Bounded-Degree Hypergrahps
• Graphs with arbitrary Ramsey number and connectivity
• Ramsey numbers of sparse hypergraphs
• Rolling backwards can move you forward: On embedding problems in sparse expanders
• On edge‐ordered Ramsey numbers
• Directed Ramsey number for trees
• Ordered Ramsey numbers

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4075489)