Unavoidable subgraphs of colored graphs
From MaRDI portal
Recommendations
Cites work
- An upper bound for some ramsey numbers
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 3259079 (Why is no real title available?)
- On a combinatorical problem of K. Zarankiewicz
- On a problem of K. Zarankiewicz
- On the number of homogeneous subgraphs of a graph
- Ramsey's theorem - a new lower bound
- Some remarks on the theory of graphs
Cited in
(19)- Note on Gy. Elekes's conjectures concerning unavoidable patterns in proper colorings
- Finding unavoidable colorful patterns in multicolored graphs
- Unbalanced spanning subgraphs in edge labeled complete graphs
- The balancing number and generalized balancing number of some graph classes
- Computing maximum unavoidable subgraphs using SAT solvers
- Dependent random choice
- Large unavoidable subtournaments
- Turán theorems for unavoidable patterns
- Large unavoidable subtournaments
- On unavoidable graphs
- Turán‐ and Ramsey‐type results for unavoidable subgraphs
- Unavoidable chromatic patterns in 2‐colorings of the complete graph
- Ramsey numbers upon vertex deletion
- Two Ramsey problems in blowups of graphs
- Recent developments on unavoidable patterns in 2-colorings of the complete graph
- Unavoidable patterns in locally balanced colourings
- The evolution of unavoidable bichromatic patterns and extremal cases of balanceability
- Unavoidable patterns in 2-colorings of the complete bipartite graph
- Unavoidable patterns
This page was built for publication: Unavoidable subgraphs of colored graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941378)
