A Ramsey-type result for the hypercube
From MaRDI portal
Publication:3419711
DOI10.1002/jgt.20181zbMath1111.05067OpenAlexW4248282558MaRDI QIDQ3419711
Radoš Radoičić, Jan Vondrák, Noga Alon, Benjamin Sudakov
Publication date: 7 February 2007
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20181
Related Items (17)
Rainbow copies of \(C_4\) in edge-colored hypercubes ⋮ Extremal numbers for cycles in a hypercube ⋮ Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets ⋮ Inducibility in the hypercube ⋮ Coloring the cube with rainbow cycles ⋮ On even-cycle-free subgraphs of the hypercube ⋮ On crown-free families of subsets ⋮ On 14-Cycle-Free Subgraphs of the Hypercube ⋮ Maximum density of vertex-induced perfect cycles and paths in the hypercube ⋮ On even-cycle-free subgraphs of the doubled Johnson graphs ⋮ Extremal even-cycle-free subgraphs of the complete transposition graphs ⋮ A note on short cycles in a hypercube ⋮ Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube ⋮ Designing Networks with Good Equilibria under Uncertainty ⋮ Bounding the size of square-free subgraphs of the hypercube ⋮ Some Turán type results on the hypercube ⋮ Generalized Turán densities in the hypercube
Cites Work
This page was built for publication: A Ramsey-type result for the hypercube
