Bounding the size of square-free subgraphs of the hypercube

DOI10.1016/J.DISC.2008.02.015zbMATH Open1179.05059OpenAlexW2026067207MaRDI QIDQ1024494FDOQ1024494

Peter Wagner, Andrew Thomason

Publication date: 17 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.02.015

Recommendations

• Minimum critical squarefree subgraph of a hypercube
• scientific article; zbMATH DE number 434690
• 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 19183

zbMATH Keywords

hypercube\(n\)-cube\(4\)-cyclemaximum size of a subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• A Ramsey-type result for the hypercube
• Title not available (Why is that?)
• Largest induced subgraphs of the n-cube that contain no 4-cycles
• Subgraphs of a hypercube containing no small even cycles
• On the maximum number of edges in a c₄‐free subgraph of q_n
• Title not available (Why is that?)
• On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs

Cited In (25)

• Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
• Title not available (Why is that?)
• Title not available (Why is that?)
• Random polynomial graphs for random Turán problems
• Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets
• On even-cycle-free subgraphs of the doubled Johnson graphs
• Minimum critical squarefree subgraph of a hypercube
• The vertex Turán density in 3-ary \(n\)-cubes
• Subgraphs of a hypercube containing no small even cycles
• On the maximum number of edges in a c₄‐free subgraph of q_n
• Some Turán type results on the hypercube
• Component Edge Connectivity of Hypercubes
• A class of graphs of zero Turán density in a hypercube
• Extremal numbers for cycles in a hypercube
• The Complexity of Approximately Counting Retractions to Square-free Graphs
• On 14-Cycle-Free Subgraphs of the Hypercube
• Extremal even-cycle-free subgraphs of the complete transposition graphs
• On graphs embeddable in a layer of a hypercube and their extremal numbers
• On a covering problem in the hypercube
• On even-cycle-free subgraphs of the hypercube
• On even-cycle-free subgraphs of the hypercube
• Hypercube 1-factorizations from extended Hamming codes
• Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes
• Vertex Turán problems in the hypercube
• Maximum density of vertex-induced perfect cycles and paths in the hypercube

This page was built for publication: Bounding the size of square-free subgraphs of the hypercube

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