All Questions
Tagged with graph-minors set-theory
4 questions
2
votes
1
answer
154
views
Induced minors of $\{0,1\}^\omega$
Let $G=(V,E)$ be a simple, undirected graph. Suppose that ${\cal S}$ is a collection of non-empty, connected, and pairwise disjoint subsets of $V$. Let $G({\cal S})$ be the graph with vertex set ${\...
0
votes
1
answer
133
views
Large complete minors of $\mathbb{Z}^\omega$
Let $x,y\in \mathbb{Z}^\omega$ and let $x,y\in\mathbb{Z}^\omega$ form an edge if there is $i\in\omega$ such that $|x_i - y_i|=1$ and $ x_k = y_k$ for all $k\in \omega\setminus\{i\}$.
$K_\omega$, the ...
1
vote
0
answers
127
views
Ordinal corresponding to well-quasi-order on graphs
Let $K$ be an infinite cardinal. Then, by the Robertson–Seymour theorem, the set of graphs with fewer than $K$ vertices and edges form a well-quasi-order.
In terms of $K$, what is the maximal order ...
2
votes
1
answer
189
views
Minors of graphs with infinite chromatic number
Let $G=(V,E)$ be an infinite simple, undirected graph with $\chi(G) \geq \aleph_0$. Is there a minor $M$ of $G$ such that
$M\not\cong G$, and
$\chi(M)=\chi(G)$
?