scientific article; zbMATH DE number 7471101
From MaRDI portal
Publication:5026974
zbMath1482.05331MaRDI QIDQ5026974
Masahito Yamazaki, Naoki Matsumoto, Masaki Yamamoto
Publication date: 8 February 2022
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/81/ajc_v81_p208.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large triangle-free subgraphs in graphs without \(K_ 4\)
- Matching theory
- Three hundred million points suffice
- The Ramsey property for graphs with forbidden complete subgraphs
- On a family of line-critical graphs
- On Ramsey numbers and \(K_ r\)-coloring of graphs
- On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$
- Explicit Construction of Small Folkman Graphs
- On the Folkman Numberf(2, 3, 4)
- Computation of the Folkman numberFe(3, 3; 5)
- Small minimal $(3, 3)$-Ramsey graphs
- A Theorem on k-Saturated Graphs
- The edge Folkman number $F_e(3, 3; 4)$ is greater than 19
- Use of MAX-CUT for Ramsey Arrowing of Triangles
- On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon
- Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
- Some covering concepts in graphs
- The Two-Triangle Case of the Acquaintance Graph
This page was built for publication:
