On induced subgraphs of the cube
From MaRDI portal
Publication:1107541
DOI10.1016/0097-3165(88)90034-9zbMath0653.05037OpenAlexW2166264168MaRDI QIDQ1107541
P. D. Seymour, Ronald L. Graham, Fan R. K. Chung, Zoltan Fueredi
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
Related Items
Induced subgraphs of powers of oriented cycles, Edge-Isoperimetric Problem for Cayley Graphs and Generalized Takagi Functions, Matchings and paths in the cube, Vertex Turán problems for the oriented hypercube, On sensitivity in bipartite Cayley graphs, On induced subgraphs of the Hamming graph, Induced subgraphs of product graphs and a generalization of Huang's theorem, An induced subgraph of the Hamming graph with maximum degree 1, Induced subgraph and eigenvalues of some signed graphs, Sperner's Theorem and a Problem of Erdős, Katona and Kleitman, The Proofs of Two Directed Paths Conjectures of Bollobás and Leader, On the resolution of the sensitivity conjecture, Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses, Unnamed Item, Large convex cones in hypercubes, The equivalence of two problems on the cube, The minimum number of disjoint pairs in set systems and related problems, Vertex Turán problems in the hypercube, An improved lower bound on the sensitivity complexity of graph properties, Unnamed Item, Rapid almost-complete broadcasting in faulty networks, Counterexamples to “A conjecture on induced subgraphs of Cayley graphs”, A new lower bound for the bipartite crossing number with applications, On spanning tree congestion of graphs, Spanning tree congestion of the hypercube, Induced subgraphs of hypercubes and a proof of the sensitivity conjecture, Large Convex Cones in Hypercubes, The number of edges in a subgraph of a Hamming graph, Maximizing Möbius functions on subsets of Boolean algebras
Cites Work
