Ramsey theory for graph connectivity

DOI10.1002/jgt.3190070113zbMath0512.05044OpenAlexW2037122623MaRDI QIDQ4750676

David W. Matula

Publication date: 1983

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

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

zbMATH Keywords

edge-coloring of the complete graphmonochromatic k-connected subgraph

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Connectivity (05C40)

Related Items (max. 100)

On the number of edges in a graph with no \((k + 1)\)-connected subgraphs ⋮ On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs ⋮ Ramsey theory for highly connected monochromatic subgraphs ⋮ On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs

Cites Work

• Unnamed Item
• On Ramsey theory and graphical parameters
• Ramsey theory and chromatic numbers

This page was built for publication: Ramsey theory for graph connectivity