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

On the edge numbers of graphs with Hadwiger number 4 and 5

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

DOI10.1007/BF01848093zbMath0522.05037OpenAlexW2166752222MaRDI QIDQ1055783

Ervin Gyoeri

Publication date: 1982

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

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


zbMATH Keywords

extremal problemHadwiger numbersubcontraction


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)


Related Items (3)

The spectral radius of minor-free graphs ⋮ The extremal function for \(K_{9}\) minors ⋮ Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application.




Cites Work

  • Contractions of graphs: A theorem of Ore and an extremal problem
  • Homomorphiesätze für Graphen
  • On some graph-theoretical problems of V. G. Vizing




This page was built for publication: On the edge numbers of graphs with Hadwiger number 4 and 5

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1055783&oldid=13069203"
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 23:21.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki