Chrome Extension
WeChat Mini Program
Use on ChatGLM

Turn graphs with bounded matching number

JOURNAL OF COMBINATORIAL THEORY SERIES B(2024)

Cited 0|Views20
No score
Abstract
We determine the maximum possible number of edges of a graph with n vertices, matching number at most s and clique number at most k for all admissible values of the parameters.(c) 2023 Elsevier Inc. All rights reserved.
More
Translated text
Key words
Matching number,Clique number,Turan graphs
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined