On the number of F_k,4-saturating edges

DOI10.1016/J.AMC.2024.129162MaRDI QIDQ6994152zbMATH OpenFDO

Authors Yuying Li, Kexiang Xu

Publication date 24 April 2025

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AMC.2024.129162

zbMATH Keywords

extremal graphgraph saturationsaturating edges

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Cites work

• A survey of minimum saturated graphs
• Eine Extremalaufgabe aus der Graphentheorie.
• Extremal graphs for intersecting cliques
• Extremal graphs for intersecting triangles
• scientific article; zbMATH DE number 4213989 (Why is no real title available?)
• Intersection theorems for systems of sets
• On the number of K₄-saturating edges
• Some results on the saturation number for unions of cliques
• Some Theorems on Abstract Graphs
• The history of degenerate (bipartite) extremal graph problems
• The minimum number of clique-saturating edges
• Vraagstuk XXVIII.

This page was built for publication: On the number of \(F_{k,4}\)-saturating edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6994152)