The evolution of unavoidable bichromatic patterns and extremal cases of balanceability
From MaRDI portal
Cites work
- A bound on the strong chromatic index of a graph
- A Ramsey-type theorem for the matching number regarding connected graphs
- A stronger bound for the strong chromatic index
- Colored unavoidable patterns and balanceable graphs
- Dependent random choice
- Finding unavoidable colorful patterns in multicolored graphs
- Graphs isomorphisms under edge-replacements and the family of amoebas
- Graphs with constant balancing number
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 3628985 (Why is no real title available?)
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- scientific article; zbMATH DE number 3019031 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- Induced matchings in bipartite graphs
- Induced Ramsey number for a star versus a fixed graph
- Induced Ramsey-type theorems
- Induced Turán numbers
- Intersection theorems for systems of sets
- Intersection Theorems for Systems of Sets
- Many \(T\) copies in \(H\)-free graphs
- New recursive constructions of amoebas and their balancing number
- Norm-graphs and bipartite Turán numbers
- Norm-graphs: Variations and applications
- On a problem of formal logic.
- On a problem of K. Zarankiewicz
- On Graphs that do not Contain a Thomsen Graph
- On maximal paths and circuits of graphs
- On small balanceable, strongly-balanceable and omnitonal graphs
- On the balanceability of some graph classes
- On the number of edges of quadrilateral-free graphs
- The Erdős-Hajnal conjecture. A survey
- The history of degenerate (bipartite) extremal graph problems
- Turán numbers for disjoint copies of graphs
- Turán theorems for unavoidable patterns
- Turán‐ and Ramsey‐type results for unavoidable subgraphs
- Two Ramsey problems in blowups of graphs
- Unavoidable chromatic patterns in 2‐colorings of the complete graph
- Unavoidable patterns
- Unavoidable patterns in locally balanced colourings
- Unavoidable subgraphs of colored graphs
- Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\)
This page was built for publication: The evolution of unavoidable bichromatic patterns and extremal cases of balanceability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6883682)
