241 reputation
211
bio website
location
age
visits member for 3 years, 2 months
seen May 4 at 1:20

Jul
2
awarded  Curious
Apr
16
awarded  Popular Question
Mar
28
accepted Long induced path containing a lot of vertices from a stable set
Mar
28
comment Long induced path containing a lot of vertices from a stable set
very nice thank you
Mar
27
accepted Coproduct diagram for tensor product
Mar
27
comment Long induced path containing a lot of vertices from a stable set
oops, i forgot to add that $G$ has bounded maximum degree! sorry about that
Mar
27
revised Long induced path containing a lot of vertices from a stable set
added 32 characters in body
Mar
27
revised Long induced path containing a lot of vertices from a stable set
added 6 characters in body
Mar
27
revised Long induced path containing a lot of vertices from a stable set
edited body
Mar
27
revised Long induced path containing a lot of vertices from a stable set
added 64 characters in body
Mar
27
asked Long induced path containing a lot of vertices from a stable set
Mar
27
comment Similar to star-comb lemma but finite graphs
nice, that's what i meant by "something close to a comb"; i want to prove that we always get an induced subgraph that's a comb with some additional edges coming from the hairs of the comb
Mar
26
comment Similar to star-comb lemma but finite graphs
well, if (connected) $G$ has big maximum degree (and has a big $K_{1,n}$ minor), it has a big $K_{1,n}$ or $K_{n}$ as induced subgraphs from Ramsey's theorem; if $G$ has bounded maximum degree, then my claim that it has the comb (or something close to a comb?) as an induced subgraph. Is that false?
Mar
26
revised Similar to star-comb lemma but finite graphs
added 6 characters in body
Mar
26
comment Similar to star-comb lemma but finite graphs
oh, I'm very very sorry. I meant that has a $K_{1,r}$ minor!! (in which case the three graphs are mentioned have a star minor of course)
Mar
26
revised Similar to star-comb lemma but finite graphs
deleted 8 characters in body
Mar
26
comment Similar to star-comb lemma but finite graphs
I was thinking something like: for every positive integer $r$, there is some $n$ so that if a graph $G$ contains $K_{1,n}$ as a minor, then $G$ contains $K_{r}$, $K_{r,r}$ or a comb with $r$ leaves as an induced subgraph..
Mar
19
comment Similar to star-comb lemma but finite graphs
you are right, $S$ is infinite, apologies
Mar
19
revised Similar to star-comb lemma but finite graphs
added 2 characters in body
Mar
19
asked Similar to star-comb lemma but finite graphs