scientific article; zbMATH DE number 3970790
An ordinary graph is a finite linear graph which contains no loops or multiple edges, and in which all edges are undirected. In such a graph G, let e(G) and t(G) denote respectively the number of edges and triangles. Let \(n\geq r\geq 1\) and \(n=rk+\nu\), where n, r, k, \(\nu\) are integers and \(0\leq \nu \leq r-1\). Further let \(T_ r(n)\) denote a graph with n vertices and the following structure: the vertices are partitioned into \(\nu\) classes of \(k+1\) and r-\(\nu\) classes of k elements each, the classes being mutually disjoint, and two vertices are joined by an edge if and only if they do not belong to the same class. The main result in this paper is the following Theorem. Let n and r be integers, \(n\geq r\geq 2\), and G be an ordinary graph with n vertices. If \(t(G)\leq t(T_ r(n))\), then \(e(G)\leq e(T_ r(n))\) and equality \(e(G)=e(T_ r(n))\) holds if and only if the graph G is isomorphic to \(T_ r(n)\).
- Another extremal problem for Turan graphs
- Turán theorems with repeated degrees
- On a problem in extremal graph theory
- Another extremal property of some Turán graphs
- On the structure of linear graphs
- Extremal graph for intersecting odd cycles
- Extensions of extremal graph theory to grids
- scientific article; zbMATH DE number 4181368 (Why is no real title available?)
- Note on Turán's graph
- scientific article; zbMATH DE number 2138155 (Why is no real title available?)
- scientific article; zbMATH DE number 3243 (Why is no real title available?)
- Edge Grundy numbers of the regular Turán graphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- An Extremal Property of Turán Graphs, II
- scientific article; zbMATH DE number 3258858 (Why is no real title available?)
- scientific article; zbMATH DE number 3365308 (Why is no real title available?)
- scientific article; zbMATH DE number 4187846 (Why is no real title available?)
- scientific article; zbMATH DE number 4189765 (Why is no real title available?)
- An extremal property of Turán graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3737459)