Browsing LSP-Jurnal Ilmiah Dosen by Subject "3-matching"
Now showing items 1-1 of 1
-
On Ramsey Minimal Graphs for a 3-Matching Versus a Path on Five Vertices
(Proceedings of the International Conference on Mathematics, Geometry, Statistics, and Computation, 2022-02-08)Let 𝐺, 𝐻, and 𝐹 be simple graphs. The notation 𝐹 ⟶ (𝐺, 𝐻) means that any red-blue coloring of all edges of 𝐹 contains a red copy of 𝐺 or a blue copy of 𝐻. The graph 𝐹 satisfying this property is called a Ramsey ...