On induced subgraphs of the cube
From MaRDI portal
Publication:1107541
DOI10.1016/0097-3165(88)90034-9zbMath0653.05037MaRDI QIDQ1107541
P. D. Seymour, Zoltan Fueredi, Fan R. K. Chung, Ronald L. Graham
Publication date: 1988
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(88)90034-9
05C35: Extremal problems in graph theory
Related Items
An improved lower bound on the sensitivity complexity of graph properties, Large convex cones in hypercubes, Vertex Turán problems in the hypercube, Rapid almost-complete broadcasting in faulty networks, On spanning tree congestion of graphs, Spanning tree congestion of the hypercube, The equivalence of two problems on the cube, Maximizing Möbius functions on subsets of Boolean algebras, Matchings and paths in the cube, A new lower bound for the bipartite crossing number with applications, The number of edges in a subgraph of a Hamming graph, Large Convex Cones in Hypercubes
Cites Work