An extremal problem concerning graphs not containing K_t and K_t,t
From MaRDI portal
Publication:1969798
This paper considers the problem of determining the maximum number of edges of a graph of order \(n\) that contains neither \(K_t\) nor \(K_{t,t}\) as a subgraph, where \(t\) and \(n\) are positive integers with \(n\geq t\geq 2\). The author has solved this problem for \(n= 2t+1\) in this paper. This problem is solved by Turán's theorem for \(n< 2t\), and for \(n= 2t\) it has been solved by \textit{R. A. Brualdi} and \textit{S. Mellendorf} [Electron. J. Comb. 1, R2 (1994; Zbl 0810.05041)].
Recommendations
- An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,n-t}\)
- Turán number of bipartite graphs with no \(K_{t,t}\)
- Two extremal problems in graph theory
- On extremal graphs without compatible triangles or quadrilaterals
- An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,t,t}\)
Cited in
(5)- On extremal graphs without compatible triangles or quadrilaterals
- Erratum: An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,n-t}\) [Discrete Mathematics 187 (1998) 195-209]
- An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,n-t}\)
- An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,t,t}\)
- An extremal problem onKr-free graphs
This page was built for publication: An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,t}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969798)
