• Corpus ID: 250311484

Maximum size of a triangle-free graph with bounded maximum degree and matching number

@inproceedings{Ahanjideh2022MaximumSO,
  title={Maximum size of a triangle-free graph with bounded maximum degree and matching number},
  author={Milad Ahanjideh and T{\'i}naz Ekim and Mehmet Akif Yıldız},
  year={2022}
}
Determining the maximum number of edges under degree and matching number constraints have been solved for general graphs in [7] and [2]. It follows from the structure of those extremal graphs that deciding whether this maximum number decreases or not when restricted to claw-free graphs, to C 4 -free graphs or to triangle-free graphs are separately interesting research questions. The first two cases being already settled in [8] and [4], in this paper we focus on triangle-free graphs. We show that… 

Figures from this paper

References

SHOWING 1-10 OF 16 REFERENCES

Ramsey Numbers for Line Graphs and Perfect Graphs

All Ramsey numbers for perfect graphs and for several subclasses of perfect graphs are determined, including an upper bound on the number of edges any graph can have if it has bounded degree and bounded matching size.

Maximum matching and a polyhedron with 0,1-vertices

The emphasis in this paper is on relating the matching problem to the theory of continuous linear programming, and the algorithm described does not involve any "blind-alley programming" -which, essentially, amounts to testing a great many combinations.

Graphs with restricted valency and matching number

ODD Cycles of Specified Length in Non-Bipartite Graphs

AN EXTREMAL PROBLEM IN GRAPH THEORY

G(?z; I) will denote a graph of n vertices and 1 edges. Let fO(lz, K) be the smallest integer such that there is a G (n; f,, (n, k)) in which for every set of K vertices there is a vertex joined to

Degrees and matchings

Intersection Theorems for Systems of Sets