Two infinite classes of unicyclic Ramsey (P3, P4) – Minimal graphs

Authors:

Open Access

1 January 2024

conference paper
Published by AIP Publishing in AIP Conference Proceedings

Vol. 3049 (1)
DOI:10.1063/5.0193790

Abstract

Let G and H be simple graphs, the notation F → (G, H) means that for any red-blue coloring of all the edges of graph F implies F contains either a red copy of G

Keywords

This publication has 9 references indexed in Scilit:

On Ramsey (P4, P4) –minimal graphs for small-order
2020
Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs
SIAM Journal on Discrete Mathematics, 2018
Some infinite families of Ramsey ${P P}_{3}, {P P}_{n n}$ -minimal trees
2017
On the minimum degree of minimal Ramsey graphs for multiple colours
Journal of Combinatorial Theory, Series B, 2016
Minimum Degrees of Minimal Ramsey Graphs for Almost‐Cliques
Journal of Graph Theory, 2016
Recent developments in graph Ramsey theory
2015
On Ramsey Minimal Graphs for the Pair Paths
Procedia Computer Science, 2015
What is Ramsey-equivalent to a clique?
Journal of Combinatorial Theory, Series B, 2014
Non-bipartite pairs of $3$ -connected graphs are highly Ramsey-infinite
European Journal of Combinatorics, 2014