On the maximum number of edges in a c4‐free subgraph of qn

DOI10.1002/JGT.3190190104MaRDI QIDQ4320463zbMATH OpenOpenAlexFDO

Authors Heiko Harborth, Hauke Nienborg, Peter Brass

Publication date 1 February 1995

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190190104

zbMATH Keywords

cube-graphErdős conjecturenumber of edgessubgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• Bounding the size of square-free subgraphs of the hypercube
• scientific article; zbMATH DE number 790416
• An extremal theorem in the hypercube
• Largest induced subgraphs of the n-cube that contain no 4-cycles
• On the number of edges of quadrilateral-free graphs

Cited in

(29)

• Bounding the size of square-free subgraphs of the hypercube
• Some Turán type results on the hypercube
• Computational experience with approximation algorithms for the set covering problem
• Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
• Every graph of sufficiently large average degree contains a C₄-free subgraph of large average degree
• The vertex Turán density in 3-ary \(n\)-cubes
• Generalized Turán densities in the hypercube
• Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
• Which graphs can be counted in C₄-free graphs?
• Hypercube 1-factorizations from extended Hamming codes
• scientific article; zbMATH DE number 434690 (Why is no real title available?)
• scientific article; zbMATH DE number 4177100 (Why is no real title available?)
• scientific article; zbMATH DE number 3880754 (Why is no real title available?)
• On 14-Cycle-Free Subgraphs of the Hypercube
• Minimum critical squarefree subgraph of a hypercube
• scientific article; zbMATH DE number 19183 (Why is no real title available?)
• Hypercube subgraphs with local detours
• On a covering problem in the hypercube
• On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs
• Saturated subgraphs of the hypercube
• Saturation in the hypercube and bootstrap percolation
• Largest induced subgraphs of the n-cube that contain no 4-cycles
• On even-cycle-free subgraphs of the hypercube
• On even-cycle-free subgraphs of the hypercube
• Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets
• A class of graphs of zero Turán density in a hypercube
• On graphs embeddable in a layer of a hypercube and their extremal numbers
• Sensitivity conjecture and signed hypercubes
• Girth tenacity of some cube-like networks

This page was built for publication: On the maximum number of edges in a c₄‐free subgraph of q_n

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