Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On an extremal problem in graph theory.

From MaRDI portal
Publication:775325
Jump to:navigation, search

DOI10.1007/BF01650069zbMath0105.17504OpenAlexW2082072822MaRDI QIDQ775325

No author found.

Publication date: 1962

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01650069


zbMATH Keywords

topology


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)


Related Items (6)

An \(A_\alpha\)-spectral Erdős-Pósa theorem ⋮ Extremal numbers for disjoint copies of a clique ⋮ Path Saturation Game on Six Vertices ⋮ Unnamed Item ⋮ The Turań number of \(2P_7\) ⋮ Extremal graphs for two vertex-disjoint copies of a clique




Cites Work

  • On maximal paths and circuits of graphs
  • On the theory of graphs
  • On the structure of linear graphs
  • Unnamed Item




This page was built for publication: On an extremal problem in graph theory.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:775325&oldid=12695444"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 10:46.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki