Some extremal problems for hereditary properties of graphs
classification
🧮 math.CO
keywords
extremalhereditarysomeansweredanswersbelongsedgesgraph
read the original abstract
This note answers extremal questions like: what is the maximum number of edges in a graph of order n, which belongs to some hereditary property. The same question is answered also for the spectral radius and other similar parameters.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.