Saturated Subgraphs of the Hypercube

DOI10.1017/S0963548316000316zbMath1371.05158arXiv1406.1766MaRDI QIDQ5366933

Trevor Pinto, J. Robert Johnson

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.1766

zbMATH Keywords

\((Q_n,Q_m)\)-saturated graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Density (toughness, etc.) (05C42)

Related Items (5)

Saturation number of \(tK_{l,l,l}\) in the complete tripartite graph ⋮ On saturated \(k\)-Sperner systems ⋮ Rainbow Saturation for Complete Graphs ⋮ The \(Q_2\)-free process in the hypercube ⋮ Partite Saturation of Complete Graphs

Cites Work

• On saturated \(k\)-Sperner systems
• A survey of minimum saturated graphs
• Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
• On the maximum number of edges in a c₄‐free subgraph of q_n
• A Problem in Graph Theory
• Turán’s Theorem in the Hypercube
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Saturated Subgraphs of the Hypercube