The Turán number of the graph
Halina Bielak; Sebastian Kieliszek
Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica (2014)
- Volume: 68, Issue: 1
- ISSN: 0365-1029
Access Full Article
topAbstract
topHow to cite
topReferences
top- Bushaw, N., Kettle, N., Turán numbers of multiple paths and equibipartite forests, Combin. Probab. Comput. 20 (2011), 837-853.
- Erdős, P., Gallai, T., On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hungar. 10 (1959), 337-356.
- Faudree, R. J., Schelp, R. H., Path Ramsey numbers in multicolorings, J. Combin. Theory Ser. B 19 (1975), 150-160.
- Gorgol, I., Turán numbers for disjoint copies of graphs, Graphs Combin. 27 (2011), 661-667.
- Harary, F., Graph Theory, Addison-Wesley, Mass.-Menlo Park, Calif.-London, 1969.