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

DOI10.1016/S0012-365X(98)00195-2zbMATH Open0924.05042MaRDI QIDQ1297399FDOQ1297399

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Graphs with maximal number of adjacent pairs of edges
• Title not available (Why is that?)
• Comparisons of Bayesian estimation procedures for two-way contingency tables without interaction

Cited In (8)

• On the construction of locally most reliable two-terminal graphs
• Extremality of degree-based graph entropies
• An Extremal Problem of Graphs with Diameter 2
• On locally most reliable three-terminal graphs of sparse graphs
• Maximizing the degree powers of graphs with fixed size
• Nonexistence of uniformly most reliable two-terminal graphs
• Uniformly most reliable three-terminal graph of dense graphs
• The average diameter and its estimation in nonlinear structures

   Recommendations

• An Extremal Problem of Graphs with Diameter 2 👍 👎
• An extremal problem for paths in bipartite graphs 👍 👎
• Maximum number of colorings of (2k, k²)‐graphs 👍 👎
• Extremal graphs and multigraphs with two weighted colours 👍 👎
• Turán-Ramsey theorems and simple asymptotically extremal structures 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297399)