vecwxt
anything anything
[center]
[center]
Anything
What I'm working on IRL
item textbf{Definition:} Let $G$ be any graph. We'll define the textbf{complement} of $G$ (and write $overline{G}$) to be the graph with $V(overline{G}) = V(G)$ (i.e., both graphs have the same set of vertices), but $ab$ is in $E(overline{G})$ if and only if $ab$ is emph{not} in $E(G)$.
begin{enumerate} item Let $G$ be the graph shown on the left. Using the vertices on the right, draw $overline{G}$. vspace*{0.2in}
begin{tikzpicture}
filldraw (30:1) circle (2pt);
filldraw (90:1) circle (2pt);
filldraw (150:1) circle (2pt);
filldraw (210:1) circle (2pt);
filldraw (270:1) circle (2pt);
filldraw (330:1) circle (2pt);
draw (30:1) -- (90:1) -- (150:1) -- (210:1) -- (270:1) -- (330:1) -- (30:1);
end{tikzpicture} hspace{2in}
begin{tikzpicture}
filldraw (30:1) circle (2pt);
filldraw (90:1) circle (2pt);
filldraw (150:1) circle (2pt);
filldraw (210:1) circle (2pt);
filldraw (270:1) circle (2pt);
filldraw (330:1) circle (2pt);
draw[black!30,loosely dotted] (30:1) -- (90:1) -- (150:1) -- (210:1) -- (270:1) -- (330:1) -- (30:1);
end{tikzpicture}
vfill
item Prove that if $G$ has six vertices, then $G$ and $overline{G}$ cannot both be bipartite.
vfill
end{enumerate}
whatever.
In loving memory of Need posting achievements?Then join Posting Frenzy Achievement Items - searchable list List of Borders and cutouts New at Fresh and Flavorful Ping Group