An edge extremal result for subcohesion

DOI10.1016/0095-8956(85)90087-5zbMATH Open0535.05041OpenAlexW1992747407MaRDI QIDQ790835FDOQ790835

N. E. Zubov

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(85)90087-5

zbMATH Keywords

cohesionedge-connectivityedge-subconnectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• k-Components, Clusters and Slicings in Graphs
• The cohesiveness of a point of a graph

Cited In (3)

• On the sizes of \((k, l)\)-edge-maximal \(r\)-uniform hypergraphs
• The extremal sizes of arc-maximal \((k, \ell)\)-digraphs
• Characterizations of strength extremal graphs

   Recommendations

• An extremal problem in subconnectivity 👍 👎
• Characterizations of strength extremal graphs 👍 👎
• Bounding \(\ell\)-edge-connectivity in edge-connectivity 👍 👎
• Edge‐maximal (k, i)‐graphs 👍 👎
• Maximally edge-connected hypergraphs 👍 👎

This page was built for publication: An edge extremal result for subcohesion

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