Two path extremal graphs and an application to a Ramsey-type problem

DOI10.1016/S0012-365X(98)00195-2zbMath0924.05042MaRDI QIDQ1297399

Owen D. Byer

Publication date: 3 November 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

pathsextremal graphmonochromatic subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Generalized Ramsey theory (05C55)

Related Items (6)

On locally most reliable three-terminal graphs of sparse graphs ⋮ Maximizing the degree powers of graphs with fixed size ⋮ Uniformly most reliable three-terminal graph of dense graphs ⋮ Nonexistence of uniformly most reliable two-terminal graphs ⋮ Extremality of degree-based graph entropies ⋮ The average diameter and its estimation in nonlinear structures

Cites Work

• Comparisons of Bayesian estimation procedures for two-way contingency tables without interaction
• Graphs with maximal number of adjacent pairs of edges
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two path extremal graphs and an application to a Ramsey-type problem