scientific article; zbMATH DE number 1071407
From MaRDI portal
Publication:4357282
zbMATH Open0884.05058MaRDI QIDQ4357282
Publication date: 8 March 1998
Title of this publication is not available (Why is that?)
Related Items (3)
The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths โฎ Edge maximal C_{2k+1}-edge disjoint free graphs โฎ Title not available (Why is that?)
Recommendations
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree ๐ ๐
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs ๐ ๐
- Maximum number of edges in a critically \(k\)-connected graph ๐ ๐
- Edge-maximal \(C_{2k+1}\)-vertex disjoint free graphs ๐ ๐
- An extremal problem onKr-free graphs ๐ ๐
- Edgeโmaximal (k, i)โgraphs ๐ ๐
- Edge maximal C_{2k+1}-edge disjoint free graphs ๐ ๐
- Edge-Maximal ๐k+1-Edge Disjoint Free Graphs ๐ ๐
- The number of K s,t -free graphs ๐ ๐
- On the number of edges in maximally linkless 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 Q4357282)