scientific article

zbMath0316.05110MaRDI QIDQ4075489

Stefan A. Burr

Publication date: 1975

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (31)

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

This page was built for publication: