Work

On graphs for which large books are Ramsey good

Year: 2024

Type: article

Abstract: Let be a graph and a connected graph. Then is said to be ‐good if the Ramsey number is equal to the general lower bound , where and are the chromatic number and the chromatic surplus of , respectively. For a fixed graph with and , it is shown that if , then large are ‐good if and only if is a subgraph of for some , where is a matching of edges. We also give conditions for with respect to ‐goodness of large .

Source: Journal of Graph Theory

DOI: 10.1002/jgt.23193

Authors: Meng Liu, Yusheng Li

Institutions: Anhui University, Tongji University

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: bronze

Funders: National Science Foundation, National Natural Science Foundation of China

Awards: G4480806653, G478768364