Minimum critical squarefree subgraph of a hypercube

MaRDI QIDQ3616001zbMATH OpenFDO

Authors Sul-young Choi, Puhua Guan

Publication date 24 March 2009

zbMATH Keywords

hypercubesquarefree subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 5778712
• Bounding the size of square-free subgraphs of the hypercube
• On the maximum number of edges in a c₄‐free subgraph of q_n
• An extremal theorem in the hypercube
• scientific article; zbMATH DE number 434690

Cited in

(10)

• Bounding the size of square-free subgraphs of the hypercube
• The partite saturation number of spider
• scientific article; zbMATH DE number 434690 (Why is no real title available?)
• scientific article; zbMATH DE number 5778712 (Why is no real title available?)
• Partite saturation of complete graphs
• Saturated subgraphs of the hypercube
• Saturation in the hypercube and bootstrap percolation
• Rainbow Saturation for Complete Graphs
• Saturation of K₄ subdivisions in multidimensional grids
• A saturation problem in meshes

This page was built for publication: Minimum critical squarefree subgraph of a hypercube

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