Partitionstheoreme für Graphen
From MaRDI portal
Publication:1220087
DOI10.1007/BF02565753zbMath0313.05120MaRDI QIDQ1220087
Publication date: 1975
Published in: Commentarii Mathematici Helvetici (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/139626
Related Items (12)
Partition properties of q-hypergraphs ⋮ A consistent edge partition theorem for infinite graphs ⋮ Intersection dimensions of graph classes ⋮ Distance Preserving Ramsey Graphs ⋮ Induced partition properties of combinatorial cubes ⋮ A short proof of the induced Ramsey theorem for hypergraphs ⋮ Partition theorems for parameter systems and graphs ⋮ Ramsey classes of topological and metric spaces ⋮ Embedding finite graphs into graphs colored with infinitely many colors ⋮ Iterated combinatorial density theorems ⋮ Embedding Graphs into Colored Graphs ⋮ Two remarks on Ramsey's theorem
This page was built for publication: Partitionstheoreme für Graphen
