An edge extremal result for subcohesion

DOI10.1016/0095-8956(85)90087-5MaRDI QIDQ790835zbMATH OpenOpenAlexFDO

Authors 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)

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

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• k-Components, Clusters and Slicings in Graphs
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• The cohesiveness of a point of a graph

Cited in

(6)

• 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
• Spectral conditions for the maximum subgraph edge-connectivity of graphs
• A survey on the vertex-(edge-)k-maximal graphs and the k-vertex-(edge-)connected graphs with redundant subgraphs
• An extremal problem in subconnectivity

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)