I have already used some of the inequalities discussed in my graph theory class (e ≤ 3v − 6 etc.) which seem to be giving me nothing thus far. I'm trying to apply Kuratowski's theorem to see if it contains subgraphs that are subdivisions of $K_{3,3}$ or $K_5$ but it isn't really clear to me how to search for these or what I should be looking for in general.
2026-03-28 14:07:38.1774706858
Planarity of 4-dimensional hypercube graph with 2 adjacent vertices deleted
637 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in GRAPH-THEORY
- characterisation of $2$-connected graphs with no even cycles
- Explanation for the static degree sort algorithm of Deo et al.
- A certain partition of 28
- decomposing a graph in connected components
- Is it true that if a graph is bipartite iff it is class 1 (edge-coloring)?
- Fake induction, can't find flaw, every graph with zero edges is connected
- Triangle-free graph where every pair of nonadjacent vertices has exactly two common neighbors
- Inequality on degrees implies perfect matching
- Proving that no two teams in a tournament win same number of games
- Proving that we can divide a graph to two graphs which induced subgraph is connected on vertices of each one
Related Questions in PLANAR-GRAPHS
- max planarity and triangulation
- How to find a minimal planar covering of a graph
- Complete bipartite planar graphs
- Is graph Planar?
- Kuratowski's theorem on Planar graphs
- Graph Theory: Degree of regions in a planar graph
- On the Hex/Nash connection game theorem
- Graph Theory: There is only one planar graph with all vertices of degree 4 and 10 regions
- Intersection of circles and regions
- Which of these graphs is planar?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
We shall apply the same observation which is used to show non-planarity of $K_{3,3}$.
First, we remark that the graph of any $d$-dimensional cube is bipartite, because we can consider its vertex set as $\{0,1\}\subset \Bbb Z^d$ with the color classes consisting of vertices with odd and even sum of coordinates, respectively.
Now let $G$ be an arbitrary planar bipartite graph. For instance, we can pick as $G$ the mysterious graph $Q^4_-$ from your question or the famous $K_{3,3}$.
Let $G$ has a plane drawing with $n$ vertices, $m$ edges, and $k$ faces. By Euler’s formula, $n-m+k=2.$
Now double count a number $N$ of pairs $(e, f)$ where $e$ is a edge of the graph $G$ incident to its face $f$. Since $G$ is bipartite, each its face $G$ has even degree, so it is at least $4$. Thus each face $f$ of $G$ contributes at least $4$ to the sum for $N$, implying $N\ge 4k$. On the other hand, each edge $e$ of $G$ is incident to exactly $2$ faces (we also count the outer face, if needed), so it contributes exactly $2$ to the sum for $N$, implying $N=2m$. Thus $2m=N\ge 4k$.
Combining the obtained inequality with Euler’s formula, we obtain $k=2+m-n\le m/2$, or $m+4\le 2n$.
For the graph $Q^4_-$ we have $n=2^4-2=14$. To calculate $m$ we remark that each vertex of $4$-dimensional cube has degree $4$, so it has $2^4\cdot 4/2=32$ (we divided by $2$ because we double counted each edge), so when we remove from the cube two adjacent vertices we remove also $4+4-1=7$ edges (we subtract $1$, because we double counted the edge between removed vertices). Thus $m=32-7=25$.
Finally, we see that $m+4=25+4=29>28=2n$, so the graph $Q^4_-$ is non-planar.