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

Ramsey problems and their connection to tuŕan-type extremal problems

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

DOI10.1002/jgt.3190160105zbMath0770.05075OpenAlexW2068745402MaRDI QIDQ3990872

Ralph J. Faudree, Miklós Simmonovits

Publication date: 28 June 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190160105


zbMATH Keywords

treeRamsey numberedge coloringchromatic numberdecomposition class


Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)


Related Items (3)

A neighborhood condition which implies the existence of a class of d‐chromatic subgraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Generalized and geometric Ramsey numbers for cycles.



Cites Work

  • Unnamed Item
  • Margulis
  • Graph Theory and Probability. II




This page was built for publication: Ramsey problems and their connection to tuŕan-type extremal problems

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