scientific article; zbMATH DE number 3470438
From MaRDI portal
Publication:4056030
Cited in
(26)- On the use of senders in generalized Ramsey theory for graphs
- Partition properties of q-hypergraphs
- On universality of graphs with uniformly distributed edges
- Local k-colorings of graphs and hypergraphs
- Induced partition properties of combinatorial cubes
- Restricted Ramsey configurations
- On ordered graphs and graph orderings
- Upper bounds for a Ramsey theorem for trees
- A Ramsey class for Steiner systems
- Two proofs of the Ramsey property of the class of finite hypergraphs
- Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete.
- A note on lower bounds for induced Ramsey numbers
- Extremal results in sparse pseudorandom graphs
- Induced Ramsey number for a star versus a fixed graph
- On edge-ordered Ramsey numbers
- Some recent results on Ramsey-type numbers
- A note on induced Ramsey numbers
- An efficient container lemma
- Ramsey properties of products of chains
- Induced Ramsey-type theorems
- Multicolor induced Ramsey numbers
- Induced Ramsey problems for trees and graphs with bounded treewidth
- Effective bounds for induced size-Ramsey numbers of cycles (extended abstract)
- Induced partition theorems
- A short proof of the induced Ramsey theorem for hypergraphs
- On \(k\)-partite hypergraphs with the induced \(\epsilon \)-density property
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 Q4056030)
