On the maximum number of edges in a c4‐free subgraph of qn
From MaRDI portal
Publication:4320463
DOI10.1002/jgt.3190190104zbMath0810.05042OpenAlexW2282585286MaRDI QIDQ4320463
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
Related Items (16)
On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs ⋮ Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets ⋮ Saturated Subgraphs of the Hypercube ⋮ Saturation in the Hypercube and Bootstrap Percolation ⋮ On even-cycle-free subgraphs of the hypercube ⋮ On even-cycle-free subgraphs of the hypercube ⋮ On a covering problem in the hypercube ⋮ On 14-Cycle-Free Subgraphs of the Hypercube ⋮ Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube ⋮ Bounding the size of square-free subgraphs of the hypercube ⋮ Extremal problems for sets forming Boolean algebras and complete partite hypergraphs ⋮ Computational experience with approximation algorithms for the set covering problem ⋮ The vertex Turán density in 3-ary \(n\)-cubes ⋮ Some Turán type results on the hypercube ⋮ Hypercube 1-factorizations from extended Hamming codes ⋮ Generalized Turán densities in the hypercube
Cites Work
This page was built for publication: On the maximum number of edges in a c4‐free subgraph of qn
