User Tools
problem:aut-square
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
problem:aut-square [2013/08/19 10:47] joshuawiscons |
problem:aut-square [2013/08/22 16:30] (current) bmwoodruff |
||
|---|---|---|---|
| Line 13: | Line 13: | ||
| ---- | ---- | ||
| ==== Remarks ==== | ==== Remarks ==== | ||
| - | * $\aut(\mathcal{G})$ denotes the [[definition: | + | * $\aut(\mathcal{G})$ denotes the [[definition: |
| * $S_4$ denotes the [[definition: | * $S_4$ denotes the [[definition: | ||
| ---- | ---- | ||
| ==== $\LaTeX$ version ==== | ==== $\LaTeX$ version ==== | ||
| - | <file tex aut-square.tex> | + | <file tex problem.aut-square.tex> |
| + | %%%%% | ||
| + | % DEPENDENCIES | ||
| + | % RequiredPackages \usepackage{tikz} | ||
| + | % RequiredMacros: | ||
| + | %%%%% | ||
| \begin{problem} | \begin{problem} | ||
| Consider the graph $\mathcal{G} = (V,E)$ drawn below. The vertex set is $V$ and the (symmetric) relation giving adjacency is $E$. Specifically, | Consider the graph $\mathcal{G} = (V,E)$ drawn below. The vertex set is $V$ and the (symmetric) relation giving adjacency is $E$. Specifically, | ||
| Line 40: | Line 45: | ||
| * [[wp> | * [[wp> | ||
| - | {{tag> | + | {{tag> |
problem/aut-square.1376923657.txt.gz · Last modified: 2013/08/19 10:47 by joshuawiscons
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
