Search results

Jump to: navigation, search

Page title matches

  • <strong>[[Houston Problem Book Problem 6|Problem 6]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that a [[chainable]] [[continuum]] be [[embed|e
    504 bytes (72 words) - 22:23, 30 December 2015
  • ...ed the problems in the [http://web.mst.edu/~ingram/hpb.pdf Houston Problem Book] here.<ref>Cuchta, Tom. 2015. [http://tomcuchta.com/]</ref> | [[The Houston Problem Book Problems 1-50|The Houston Problem Book Problem Set]]
    1 KB (128 words) - 05:30, 30 November 2018
  • {{Book|Hyperspaces, Fundamentals and Recent Advances|1999|Marcel Dekker||Alejandro [[Category:Book]]
    8 KB (903 words) - 04:32, 21 December 2017
  • <strong>[[Houston Problem Book Problem 2|Problem 2]] ([[The Houston Problem Book|HPB]]): </strong> Suppose $X$ is a [[continuum]] such that for each positiv
    713 bytes (99 words) - 01:51, 26 November 2016
  • <strong>[[Houston Problem Book Problem 1|Problem 1]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[continuum]] which cannot be [[Embedding
    547 bytes (75 words) - 01:07, 27 June 2016
  • <strong>[[Houston Problem Book Problem 19|Problem 19]] ([[The Houston Problem Book|HPB]]):</strong> Does each [[strictly non-mutually aposyndetic]] [[continuu
    561 bytes (69 words) - 02:22, 31 December 2015
  • <strong>[[Houston Problem Book Problem 17|Problem 17]] ([[The Houston Problem Book|HPB]]):</strong> Is there a [[topological space]] $(X,\tau)$ on which the [
    490 bytes (63 words) - 01:40, 31 December 2015
  • <strong>[[Houston Problem Book Problem 15|Problem 15]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is an [[open map|open mapping]] of a [[compact
    621 bytes (89 words) - 23:34, 30 December 2015
  • <strong>[[Houston Problem Book Problem 13|Problem 13]] ([[The Houston Problem Book|HPB]]):</strong> Is the [[product]] of two [[strongly Hurewicz]] [[metric s
    398 bytes (49 words) - 22:58, 30 December 2015
  • <strong>[[Houston Problem Book Problem 11|Problem 11]] ([[The Houston Problem Book|HPB]]):</strong> Is each [[strongly Hurewicz]] space an [[absolute F sigma|
    483 bytes (64 words) - 22:49, 30 December 2015
  • <strong>[[Houston Problem Book Problem 5|Problem 5]] ([[The Houston Problem Book|HPB]]):</strong> Can every [[hereditarily decomposable]] [[Chainable contin
    521 bytes (67 words) - 01:57, 26 November 2016
  • <strong>[[Houston Problem Book Problem 4|Problem 4]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ is a [[Suslinean]] curve, does there exist a [[coun
    456 bytes (59 words) - 21:52, 30 December 2015
  • <strong>[[Houston Problem Book Problem 3|Problem 3]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ is a [[continuum]] such that every [[subcontinuum]]
    491 bytes (65 words) - 22:24, 30 December 2015
  • <strong>[[Houston Problem Book Problem 9|Problem 9]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[real curve]] which can be mapped [[Su
    605 bytes (81 words) - 04:32, 30 November 2018
  • <strong>[[Houston Problem Book Problem 8|Problem 8]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[rational]] curve which topologically
    457 bytes (57 words) - 22:39, 30 December 2015
  • <strong>[[Houston Problem Book Problem 7|Problem 7]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that the [[rim-type]] of any [[real curve]] (or
    459 bytes (61 words) - 22:29, 30 December 2015
  • <strong>[[Houston Problem Book Problem 10|Problem 10]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $D$ is a [[dendroid]], $S$ is [[compact]], [[finit
    656 bytes (85 words) - 04:33, 30 November 2018
  • <strong>[[Houston Problem Book Problem 12|Problem 12]] ([[The Houston Problem Book|HPB]]):</strong> Is each [[product]] of two [[Hurewicz]] [[metric space|met
    409 bytes (51 words) - 22:56, 30 December 2015
  • <strong>[[Houston Problem Book Problem 14|Problem 14]] ([[The Houston Problem Book|HPB]]):</strong> Is every [[Lindelöf]] [[totally paracompact]] space [[Hur
    364 bytes (43 words) - 23:02, 30 December 2015
  • <strong>[[Houston Problem Book Problem 16|Problem 16]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[locally confluent]] and [[light]] mappi
    637 bytes (90 words) - 23:41, 30 December 2015
  • <strong>[[Houston Problem Book Problem 18|Problem 18]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that each [[open mapping]] of a [[continuum]] $
    522 bytes (71 words) - 02:17, 31 December 2015
  • <strong>[[Houston Problem Book Problem 20|Problem 20]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is an [[open map|open]] [[continuous]] mapping
    825 bytes (131 words) - 02:54, 31 December 2015
  • <strong>[[Houston Problem Book Problem 21|Problem 21]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ is a [[planar]] [[continuum]] which has only a fini
    551 bytes (73 words) - 06:01, 31 December 2015
  • <strong>[[Houston Problem Book Problem 22|Problem 22]] ([[The Houston Problem Book|HPB]]):</strong> Does every totally non-[[semi-locally connected]] [[contin
    447 bytes (57 words) - 06:03, 31 December 2015
  • <strong>[[Houston Problem Book Problem 23|Problem 23]] ([[The Houston Problem Book|HPB]]):</strong> Does every totally non-[[semi-locally connected]] [[bicomp
    417 bytes (49 words) - 06:04, 31 December 2015
  • <strong>[[Houston Problem Book Problem 24|Problem 24]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $X$ is a [[simple tree]] and the [[widt
    472 bytes (68 words) - 06:06, 31 December 2015
  • <strong>[[Houston Problem Book Problem 25|Problem 25]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[tree-like]] [[continuum]], its [[width]
    567 bytes (87 words) - 06:08, 31 December 2015
  • <strong>[[Houston Problem Book Problem 26|Problem 26]] ([[The Houston Problem Book|HPB]]):</strong> Let $M$ be a [[locally compact]] [[metric space]] and $a \
    737 bytes (113 words) - 06:10, 31 December 2015
  • <strong>[[Houston Problem Book Problem 27|Problem 27]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is an $n$-[[dimension|dimensional]] [[compact]
    620 bytes (93 words) - 06:12, 31 December 2015
  • <strong>[[Houston Problem Book Problem 28|Problem 28]] ([[The Houston Problem Book|HPB]]):</strong> Prove that the [[Topologist's sine curve]] is not [[pseudo
    395 bytes (46 words) - 06:14, 31 December 2015
  • <strong>[[Houston Problem Book Problem 29|Problem 29]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a $1$-[[dimension|dimensional]] [[continu
    424 bytes (49 words) - 06:15, 31 December 2015
  • <strong>[[Houston Problem Book Problem 30|Problem 30]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ and $Y$ are [[Continuum|continua]] (or even [[
    683 bytes (97 words) - 04:45, 30 November 2018
  • <strong>[[Houston Problem Book Problem 31|Problem 31]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that the [[pseudo-arc]] is not [[pseudo-contrac
    366 bytes (43 words) - 06:18, 31 December 2015
  • <strong>[[Houston Problem Book Problem 32|Problem 32]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a mapping $f$ of the [[circle]] or the [[
    609 bytes (85 words) - 06:59, 31 December 2015
  • <strong>[[Houston Problem Book Problem 33|Problem 33]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $P$ is a subset of the positive integers with the
    688 bytes (104 words) - 04:42, 30 November 2018
  • <strong>[[Houston Problem Book Problem 34|Problem 34]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $f$ is a [[Function|mapping]] of a [[tr
    519 bytes (72 words) - 04:47, 30 November 2018
  • <strong>[[Houston Problem Book Problem 35|Problem 35]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[continuous]] mapping of a [[Continuum|c
    715 bytes (107 words) - 04:49, 30 November 2018
  • <strong>[[Houston Problem Book Problem 36|Problem 36]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[weakly confluent]] and [[locally conflu
    575 bytes (81 words) - 07:05, 31 December 2015
  • <strong>[[Houston Problem Book Problem 37|Problem 37]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $(X, \leq)$ is a finite [[Partially Ordered Set|pa
    904 bytes (137 words) - 04:55, 30 November 2018
  • ...The Houston Problem Book|HPB]]):</strong> Suppose $X$ in [[Houston Problem Book Problem 37|HPB Problem 37]] is $A \cup B$, where $A$ and $B$ are [[closed]]
    506 bytes (72 words) - 08:11, 31 December 2015
  • <strong>[[Houston Problem Book Problem 39|Problem 39]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a finite [[partially ordered set]] with the
    403 bytes (51 words) - 08:12, 31 December 2015
  • <strong>[[Houston Problem Book Problem 40|Problem 40]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a nonseparating ([[locally compact]]) sub
    565 bytes (76 words) - 08:13, 31 December 2015
  • <strong>[[Houston Problem Book Problem 41|Problem 41]] ([[The Houston Problem Book|HPB]]):</strong> Suppose that the [[plane]] is the union of two [[disjoint]
    530 bytes (73 words) - 09:35, 31 December 2015
  • <strong>[[Houston Problem Book Problem 42|Problem 42]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[compact]] [[metric space]] and $S$ is t
    609 bytes (93 words) - 09:37, 31 December 2015
  • <strong>[[Houston Problem Book Problem 43|Problem 43]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a curve that is [[contractible]], or [[pseu
    524 bytes (66 words) - 09:39, 31 December 2015
  • <strong>[[Houston Problem Book Problem 44|Problem 44]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[metric space]]; does [[superstable]] in
    372 bytes (46 words) - 09:40, 31 December 2015
  • <strong>[[Houston Problem Book Problem 45|Problem 45]] ([[The Houston Problem Book|HPB]]):</strong> It is true that if $Y$ is an [[arcwise connected]] [[conti
    567 bytes (75 words) - 09:43, 31 December 2015
  • <strong>[[Houston Problem Book Problem 46|Problem 46]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $Y$ is a [[compact]] [[metric space]] such that th
    497 bytes (66 words) - 09:44, 31 December 2015
  • <strong>[[Houston Problem Book Problem 47|Problem 47]] ([[The Houston Problem Book|HPB]]):</strong> Do [[atomic mapping|atomic mappings]] preserve [[semi-apos
    513 bytes (61 words) - 09:46, 31 December 2015
  • <strong>[[Houston Problem Book Problem 48|Problem 48]] ([[The Houston Problem Book|HPB]]):</strong> Is each [[unicoherent]] and [[mutually aposyndetic]] [[con
    481 bytes (58 words) - 09:48, 31 December 2015
  • <strong>[[Houston Problem Book Problem 49|Problem 49]] ([[The Houston Problem Book|HPB]]):</strong> Supppose $f$ is an [[open map|open mapping]] of a [[contin
    532 bytes (79 words) - 09:50, 31 December 2015
  • <strong>[[Houston Problem Book Problem 50|Problem 50]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[weakly confluent]] mapping of a [[conti
    493 bytes (70 words) - 09:51, 31 December 2015
  • <strong>[[Houston Problem Book Problem 51|Problem 51]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that each [[polyhedron]] is a the [[weakly conf
    419 bytes (53 words) - 09:54, 31 December 2015
  • <strong>[[Houston Problem Book Problem 52|Problem 52]] ([[The Houston Problem Book|HPB]]):</strong> Are [[strongly regular]] curves [[inverse limit|inverse li
    481 bytes (58 words) - 09:55, 31 December 2015
  • <strong>[[Houston Problem Book Problem 53|Problem 53]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ is the [[inverse limit]] of [[connected]] [[graph|g
    515 bytes (65 words) - 09:56, 31 December 2015
  • <strong>[[Houston Problem Book Problem 54|Problem 54]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that $X$ is the [[inverse limit]] of [[connecte
    554 bytes (75 words) - 09:57, 31 December 2015
  • <strong>[[Houston Problem Book Problem 55|Problem 55]] ([[The Houston Problem Book|HPB]]):</strong> Does each [[continuous]] mapping of a [[continuum]] [[onto
    424 bytes (52 words) - 09:59, 31 December 2015
  • <strong>[[Houston Problem Book Problem 56|Problem 56]] ([[The Houston Problem Book|HPB]]):</strong> Does each [[weakly confluent]] mapping of a [[continuum]]
    433 bytes (53 words) - 10:00, 31 December 2015
  • <strong>[[Houston Problem Book Problem 57|Problem 57]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that each [[uniformly pathwise connected]] [[co
    403 bytes (47 words) - 10:01, 31 December 2015
  • <strong>[[Houston Problem Book Problem 58|Problem 58]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[continuous]] mapping of a [[chainable c
    578 bytes (80 words) - 10:03, 31 December 2015
  • <strong>[[Houston Problem Book Problem 59|Problem 59]] ([[The Houston Problem Book|HPB]]):</strong> Does a [[continuum]] with zero [[surjective span]] have [[
    356 bytes (43 words) - 10:04, 31 December 2015
  • <strong>[[Houston Problem Book Problem 60|Problem 60]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $Y=G_1 \cup G_2$ where $G_1$ and $G_2$
    516 bytes (73 words) - 10:06, 31 December 2015
  • <strong>[[Houston Problem Book Problem 61|Problem 61]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $\mathcal{E}$ is the class of all finite one point
    861 bytes (129 words) - 10:11, 31 December 2015
  • <strong>[[Houston Problem Book Problem 62|Problem 62]] ([[The Houston Problem Book|HPB]]):</strong> Are all [[shape|shapes]] of [[polyhedra]] [[stable]]? (Ask
    347 bytes (41 words) - 10:12, 31 December 2015
  • <strong>[[Houston Problem Book Problem 63|Problem 63]] ([[The Houston Problem Book|HPB]]):</strong> Given a [[polyhedron]] $P$, does there exist a polyhedron
    406 bytes (53 words) - 10:13, 31 December 2015
  • <strong>[[Houston Problem Book Problem 64|Problem 64]] ([[The Houston Problem Book|HPB]]):</strong> Is each [[uniformly path-connected]] [[continuum]] [[g-con
    379 bytes (42 words) - 10:14, 31 December 2015
  • <strong>[[Houston Problem Book Problem 65|Problem 65]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that, for each [[uniformly path-connected]] [[c
    537 bytes (74 words) - 10:15, 31 December 2015
  • <strong>[[Houston Problem Book Problem 66|Problem 66]] ([[The Houston Problem Book|HPB]]):</strong> If $C$ is a [[connected]] [[Borel set|Borel subset]] of a
    503 bytes (65 words) - 10:16, 31 December 2015
  • <strong>[[Houston Problem Book Problem 67|Problem 67]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[continuum]] such that, if $C$ is a [[su
    606 bytes (84 words) - 10:18, 31 December 2015
  • <strong>[[Houston Problem Book Problem 68|Problem 68]] ([[The Houston Problem Book|HPB]]):</strong> If for each [[subcontinuum]] $C$ of the [[continuum]] $X$,
    508 bytes (67 words) - 10:19, 31 December 2015
  • <strong>[[Houston Problem Book Problem 69|Problem 69]] ([[The Houston Problem Book|HPB]]):</strong> Do [[hereditarily indecomposable]] [[tree-like]] [[continu
    402 bytes (45 words) - 10:20, 31 December 2015
  • <strong>[[Houston Problem Book Problem 70|Problem 70]] ([[The Houston Problem Book|HPB]]):</strong> Do [[uniquely lambda-connected|uniquely $\lambda$-connecte
    505 bytes (55 words) - 10:21, 31 December 2015
  • <strong>[[Houston Problem Book Problem 71|Problem 71]] ([[The Houston Problem Book|HPB]]):</strong> Suppose that $X$ is a [[continuum]] such that, if $\epsilo
    754 bytes (108 words) - 10:24, 31 December 2015
  • <strong>[[Houston Problem Book Problem 72|Problem 72]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[continuum]] such that each [[sigma-conn
    443 bytes (53 words) - 10:25, 31 December 2015
  • <strong>[[Houston Problem Book Problem 73|Problem 73]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[continuum]] such that each [[sigma-conn
    474 bytes (58 words) - 10:26, 31 December 2015
  • <strong>[[Houston Problem Book Problem 74|Problem 74]] ([[The Houston Problem Book|HPB]]):</strong> Let $f$ be a [[perfect]] [[pseudo-confluent]] mapping of a
    702 bytes (85 words) - 10:29, 31 December 2015
  • <strong>[[Houston Problem Book Problem 75|Problem 75]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[separable]] [[metric space]] which poss
    617 bytes (85 words) - 10:30, 31 December 2015
  • <strong>[[Houston Problem Book Problem 76|Problem 76]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[separable]] [[metric space]] such that,
    535 bytes (82 words) - 10:31, 31 December 2015
  • <strong>[[Houston Problem Book Problem 77|Problem 77]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that a [[continuum]] $X$ is [[regular]] if and
    459 bytes (62 words) - 10:32, 31 December 2015
  • <strong>[[Houston Problem Book Problem 78|Problem 78]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that, for each [[decomposition]] of a [[finitel
    521 bytes (65 words) - 10:34, 31 December 2015
  • <strong>[[Houston Problem Book Problem 79|Problem 79]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that no [[biconnected]] set with a [[dispersion
    423 bytes (53 words) - 10:35, 31 December 2015
  • <strong>[[Houston Problem Book Problem 80|Problem 80]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that a [[separable]] [[metric space]] is [[embe
    543 bytes (70 words) - 10:36, 31 December 2015
  • Return to the [[The Houston Problem Book|Houston Problem Book Main Page]]. {{:Houston Problem Book Problem 1}}<br />
    2 KB (263 words) - 03:52, 30 November 2018
  • <strong>[[Houston Problem Book Problem 81|Problem 81]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that each [[continuum]] of [[span zero]] [[chai
    367 bytes (47 words) - 10:38, 31 December 2015
  • <strong>[[Houston Problem Book Problem 82|Problem 82]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that each [[continuum]] of [[surjective semi-sp
    366 bytes (45 words) - 10:39, 31 December 2015
  • <strong>[[Houston Problem Book Problem 83|Problem 83]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[connected]] [[metric space]].
    710 bytes (109 words) - 10:40, 31 December 2015
  • <strong>[[Houston Problem Book Problem 84|Problem 84]] ([[The Houston Problem Book|HPB]]):</strong> Is the [[confluent]] image of an [[arc-like]] [[continuum]
    362 bytes (43 words) - 10:41, 31 December 2015
  • <strong>[[Houston Problem Book Problem 85|Problem 85]] ([[The Houston Problem Book|HPB]]):</strong> If $f$ is a [[confluent]] mapping of an [[acyclic]] (or [[
    450 bytes (57 words) - 10:42, 31 December 2015
  • Return to the [[The Houston Problem Book|Houston Problem Book Main Page]]. {{:Houston Problem Book Problem 51}}<br />
    2 KB (263 words) - 03:53, 30 November 2018
  • <strong>[[Houston Problem Book Problem 86|Problem 86]] ([[The Houston Problem Book|HPB]]):</strong> Do [[confluent]] maps of [[continuum|continua]] preserve [
    376 bytes (46 words) - 10:46, 31 December 2015
  • <strong>[[Houston Problem Book Problem 87|Problem 87]] ([[The Houston Problem Book|HPB]]):</strong> Is every [[regularly submetrizable]] [[Moore space]] [[com
    368 bytes (42 words) - 10:46, 31 December 2015
  • <strong>[[Houston Problem Book Problem 88|Problem 88]] ([[The Houston Problem Book|HPB]]):</strong> Is every [[homogeneous]] [[continuum]] [[bihomogeneous]]?
    382 bytes (42 words) - 10:47, 31 December 2015
  • <strong>[[Houston Problem Book Problem 89|Problem 89]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[noncombinatorial triangulation]] of t
    382 bytes (45 words) - 10:48, 31 December 2015
  • <strong>[[Houston Problem Book Problem 90|Problem 90]] ([[The Houston Problem Book|HPB]]):</strong> Is there a [[hereditarily equivalent]] [[continuum]] other
    387 bytes (47 words) - 10:49, 31 December 2015
  • <strong>[[Houston Problem Book Problem 91|Problem 91]] ([[The Houston Problem Book|HPB]]):</strong> Do [[hereditarily equivalent]] [[continuum|continua]] have
    365 bytes (42 words) - 10:50, 31 December 2015
  • <strong>[[Houston Problem Book Problem 92|Problem 92]] ([[The Houston Problem Book|HPB]]):</strong> If $M$ is a [[continuum]] with [[positive span]] such that
    576 bytes (75 words) - 10:51, 31 December 2015
  • <strong>[[Houston Problem Book Problem 93|Problem 93]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[homogeneous]] [[tree-like]] [[continu
    440 bytes (56 words) - 10:52, 31 December 2015
  • <strong>[[Houston Problem Book Problem 94|Problem 94]] ([[The Houston Problem Book|HPB]]):</strong> If $M$ is a [[plane continuum]] with no [[weak cut point]]
    507 bytes (65 words) - 10:53, 31 December 2015
  • <strong>[[Houston Problem Book Problem 95|Problem 95]] ([[The Houston Problem Book|HPB]]):</strong> Is the [[countable]] [[product]] of [[lambda-connected|$\l
    518 bytes (65 words) - 10:54, 31 December 2015
  • <strong>[[Houston Problem Book Problem 96|Problem 96]] ([[The Houston Problem Book|HPB]]):</strong> Is the image under a [[local homeomorphism]] of a [[delta-
    423 bytes (51 words) - 10:55, 31 December 2015
  • <strong>[[Houston Problem Book Problem 97|Problem 97]] ([[The Houston Problem Book|HPB]]):</strong> Can it be proven, without extraordinary logical assumption
    658 bytes (87 words) - 10:57, 31 December 2015
  • <strong>[[Houston Problem Book Problem 98|Problem 98]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $(X,\tau_1)$ is [[normal]], $(X,\tau_2)
    523 bytes (71 words) - 10:58, 31 December 2015
  • <strong>[[Houston Problem Book Problem 99|Problem 99]] ([[The Houston Problem Book|HPB]]):</strong> Is the [[Sorgenfrey line]] [[totally paracompact]]? (Asked
    375 bytes (44 words) - 10:59, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 100|Problem 100]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[light]] [[open mapping]] from a [[conti
    678 bytes (101 words) - 11:01, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 101|Problem 101]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is a [[continuum]] and $f$ is a [[monotone]] m
    547 bytes (79 words) - 11:05, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 102|Problem 102]] ([[The Houston Problem Book|HPB]]):</strong> Is there a non-[[locally connected]] [[continuum]] $M$ suc
    523 bytes (75 words) - 11:07, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 103|Problem 103]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is a [[hereditarily unicoherent]] and [[heredi
    503 bytes (68 words) - 11:08, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 104|Problem 104]] ([[The Houston Problem Book|HPB]]):</strong> Is the [[open image]] of a [[circle-like]] [[continuum]] a
    390 bytes (47 words) - 14:14, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 105|Problem 105]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is an [[atriodic]] $1$-[[dimension|dimensional
    902 bytes (130 words) - 14:17, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 106|Problem 106]] ([[The Houston Problem Book|HPB]]):</strong> If $M$ is [[tree-like]] and every proper [[subcontinuum]]
    409 bytes (51 words) - 14:18, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 107|Problem 107]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M_1,M_2,\ldots$ is a sequence of mutually disjoin
    518 bytes (63 words) - 14:19, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 108|Problem 108]] ([[The Houston Problem Book|HPB]]):</strong> If $M$ is a [[uniquely arcwise connected]] [[continuum]],
    492 bytes (65 words) - 14:21, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 109|Problem 109]] ([[The Houston Problem Book|HPB]]):</strong> Do [[pointwise periodic]] [[homeomorphism|homeomorphisms]]
    434 bytes (51 words) - 14:21, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 110|Problem 110]] ([[The Houston Problem Book|HPB]]):</strong> Do [[disk-like]] [[continuum|continua]] have the [[fixed p
    441 bytes (52 words) - 14:23, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 111|Problem 111]] ([[The Houston Problem Book|HPB]]):</strong> If $M$ is a [[tree-like]] [[continuum]] with the [[fixed p
    425 bytes (54 words) - 14:24, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 112|Problem 112]] ([[The Houston Problem Book|HPB]]):</strong> If $M$ is a [[contractible]] [[continuum]], do [[periodic
    437 bytes (53 words) - 14:25, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 113|Problem 113]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is a [[continuum]] which is not the [[sum]] of
    465 bytes (60 words) - 14:26, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 114|Problem 114]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that, if $X$ is a [[compact]] [[metric space]],
    724 bytes (108 words) - 14:28, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 115|Problem 115]] ([[The Houston Problem Book|HPB]]):</strong> Does every [[atriodic]] $2$-[[dimension|dimensional]] [[co
    418 bytes (46 words) - 14:28, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 116|Problem 116]] ([[The Houston Problem Book|HPB]]):</strong> If $S$ is a [[compact]], [[uniquely divisible]], [[topolog
    465 bytes (55 words) - 14:30, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 117|Problem 117]] ([[The Houston Problem Book|HPB]]):</strong> Suppose that $M$ is a [[tree-like]] [[continuum]] such tha
    506 bytes (72 words) - 14:31, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 118|Problem 118]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $H$ and $K$ are two [[continuum|continua]] with [[
    462 bytes (60 words) - 14:32, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 119|Problem 119]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $Y$ is a [[nondegenerate]] [[locally connected]] [
    678 bytes (96 words) - 14:34, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 120|Problem 120]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is the 'canonical' [[Knaster indecomposable co
    555 bytes (72 words) - 14:35, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 121|Problem 121]] ([[The Houston Problem Book|HPB]]):</strong> Does every [[hereditarily decomposable]] [[continuum]] con
    502 bytes (59 words) - 14:38, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 122|Problem 122]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $n$ is a positive integer and $M$ is a [[continuum
    609 bytes (83 words) - 14:39, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 123|Problem 123]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[widely connected]] [[complete]] [[met
    362 bytes (43 words) - 14:40, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 124|Problem 124]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is the 'canonical' [[Knaster indecomposable co
    468 bytes (58 words) - 14:41, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 125|Problem 125]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[universal]] [[hereditarily indecompos
    411 bytes (49 words) - 14:42, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 126|Problem 126]] ([[The Houston Problem Book|HPB]]):</strong> If $M$ is a [[hereditarily indecomposable]] [[continuum]]
    756 bytes (110 words) - 14:44, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 127|Problem 127]] ([[The Houston Problem Book|HPB]]):</strong> Does a mapping of the [[plane]] [[into]] itself with [[bou
    549 bytes (72 words) - 14:46, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 128|Problem 128]] ([[The Houston Problem Book|HPB]]):</strong> Given $n>0$, is there a [[continuous]] image of the $(2n+1
    452 bytes (60 words) - 14:46, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 129|Problem 129]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[chainable]] [[continuum]] $M$ in the
    509 bytes (71 words) - 14:47, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 130|Problem 130]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that, if $X$ is a [[continuum]], $f$ is a mappi
    461 bytes (63 words) - 14:48, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 131|Problem 131]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is a [[continuum]] such that, if $G$ is an [[u
    622 bytes (81 words) - 14:51, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 132|Problem 132]] ([[The Houston Problem Book|HPB]]):</strong> Is there an [[atriodic]] [[tree-like]] [[continuum]] which
    447 bytes (56 words) - 14:52, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 133|Problem 133]] ([[The Houston Problem Book|HPB]]):</strong> If $M$ is an [[atriodic]] [[tree-like]] [[continuum]] in t
    566 bytes (73 words) - 14:53, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 134|Problem 134]] ([[The Houston Problem Book|HPB]]):</strong> Is there an [[atriodic]] [[tree-like]] [[continuum]] $M$ w
    569 bytes (74 words) - 14:54, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 135|Problem 135]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is a [[hereditarily indecomposable]] [[triod-l
    484 bytes (60 words) - 14:55, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 136|Problem 136]] ([[The Houston Problem Book|HPB]]):</strong> Given a set $X$ of $n$ points on the [[plane]], a line is
    686 bytes (107 words) - 15:03, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 137|Problem 137]] ([[The Houston Problem Book|HPB]]):</strong> Is there a [[monotonely refinable]] map from a [[regular c
    445 bytes (57 words) - 14:58, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 138|Problem 138]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist, for every $k \leq m \leq \omega$, a [[to
    495 bytes (73 words) - 14:59, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 139|Problem 139]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[Lindelöf]] space $X$ and a [[complet
    490 bytes (65 words) - 15:01, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 140|Problem 140]] ([[The Houston Problem Book|HPB]]):</strong> Is a [[para-Lindelöf]] space [[paracompact]]? (Asked by W
    359 bytes (45 words) - 15:04, 31 December 2015
  • Return to the [[The Houston Problem Book|Houston Problem Book Main Page]]. {{:Houston Problem Book Problem 101}}<br />
    2 KB (263 words) - 03:54, 30 November 2018
  • ...ng>[[Houston Problem Book Problem 141|Problem 141]] ([[The Houston Problem Book|HPB]]):</strong> Is a [[collectionwise normal]] space with a [[sigma-locall
    437 bytes (54 words) - 15:06, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 142|Problem 142]] ([[The Houston Problem Book|HPB]]):</strong> Is a [[sL-cwH]], [[metacompact]] space [[para-Lindelöf]]?
    371 bytes (46 words) - 15:07, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 143|Problem 143]] ([[The Houston Problem Book|HPB]]):</strong> Does a [[para-Lindelöf]] space with a [[base]] of [[count
    455 bytes (58 words) - 15:10, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 144|Problem 144]] ([[The Houston Problem Book|HPB]]):</strong> Is there an honest (i.e. provable from [[Zermelo–Fraenke
    591 bytes (77 words) - 15:13, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 145|Problem 145]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ has a [[sigma-disjoint|$\sigma$-disjoint]] [[base]]
    548 bytes (72 words) - 15:14, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 146|Problem 146]] ([[The Houston Problem Book|HPB]]):</strong> (1) $a(i)(\mod n(i)), n(1)<n(2)< \ldots < n(k)$, is called
    653 bytes (94 words) - 15:17, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 147|Problem 147]] ([[The Houston Problem Book|HPB]]):</strong> Let there be given $n$ points in the [[plane]], no $n-k$ o
    635 bytes (91 words) - 15:18, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 148|Problem 148]] ([[The Houston Problem Book|HPB]]):</strong> Let $G(n)$ be a [[graph]] of $n$ [[vertex|vertices]]. A th
    1 KB (185 words) - 15:21, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 149|Problem 149]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that the subset $E$ of the [[complex plane]] is
    524 bytes (76 words) - 15:23, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 150|Problem 150]] ([[The Houston Problem Book|HPB]]):</strong> Let $\mathcal{F}$ be a class of mappings such that all [[h
    1 KB (194 words) - 15:27, 31 December 2015
  • ...he Houston Problem Book|HPB]]):</strong> Suppose, in the [[Houston Problem Book Problem 151|previous problem]], $X$ is a [[homogeneous]] [[continuum]], $Y$
    898 bytes (141 words) - 15:30, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 152|Problem 152]] ([[The Houston Problem Book|HPB]]):</strong> Let $M_n$ be the [[lattice]] consisting of $0,1,$ and $n$
    618 bytes (85 words) - 15:32, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 153|Problem 153]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is a [[continuum]] and $f$ is a mapping of $M$
    523 bytes (76 words) - 15:33, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 154|Problem 154]] ([[The Houston Problem Book|HPB]]):</strong> Is the space of [[automorphism|automorphisms]] of the [[ps
    387 bytes (44 words) - 15:34, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 155|Problem 155]] ([[The Houston Problem Book|HPB]]):</strong> Are [[planar]] [[dendroid|dendroids]] [[weakly chainable]]
    363 bytes (40 words) - 15:35, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 156|Problem 156]] ([[The Houston Problem Book|HPB]]):</strong> Let $X$ is a [[nondegenerate]] [[homogeneous]] [[hereditar
    466 bytes (54 words) - 15:36, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 157|Problem 157]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a finite ([[countable]]) to one mapping f
    465 bytes (53 words) - 15:37, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 158|Problem 158]] ([[The Houston Problem Book|HPB]]):</strong> Let $X$ be a [[nondegenerate]] [[continuum]] such that the
    504 bytes (61 words) - 15:38, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 159|Problem 159]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[dendroid]] $D$ such that the set $E$
    489 bytes (66 words) - 15:39, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 160|Problem 160]] ([[The Houston Problem Book|HPB]]):</strong> Let $X$ be a [[continuum]] such that the [[cone over]] $X$
    457 bytes (58 words) - 15:40, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 161|Problem 161]] ([[The Houston Problem Book|HPB]]):</strong> If the set function $T$ is [[continuous]] for the [[Hausdo
    513 bytes (70 words) - 15:44, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 162|Problem 162]] ([[The Houston Problem Book|HPB]]):</strong> If $T$ is [[continuous]] for the ([[Hausdorff]]) [[continu
    522 bytes (69 words) - 15:43, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 163|Problem 163]] ([[The Houston Problem Book|HPB]]):</strong> If $T$ is [[continuous]] for $S$ and there is a point $p \
    432 bytes (58 words) - 15:45, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 164|Problem 164]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ and $Y$ are [[indecomposable]] [[continuum|continua
    445 bytes (59 words) - 15:45, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 165|Problem 165]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ and $Y$ are [[indecomposable]] [[continuum|continua
    455 bytes (61 words) - 15:46, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 166|Problem 166]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ is a [[compact]] [[metric space|metric]] [[continuu
    711 bytes (104 words) - 15:48, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 167|Problem 167]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is a non[[compact]] [[n-manifold|$n$-manifold]
    548 bytes (72 words) - 15:50, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 168|Problem 168]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[thin]] space with infinitely many poi
    485 bytes (66 words) - 15:51, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 169|Problem 169]] ([[The Houston Problem Book|HPB]]):</strong> Is every [[aposyndetic]], [[homogeneous]], $1$-[[dimension
    428 bytes (49 words) - 15:52, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 170|Problem 170]] ([[The Houston Problem Book|HPB]]):</strong> Do there exist even integer $i$ and $j$ such that, for eve
    737 bytes (119 words) - 15:54, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 171|Problem 171]] ([[The Houston Problem Book|HPB]]):</strong> Is every [[weakly chainable]] [[atriodic]] [[tree-like]] [
    380 bytes (42 words) - 15:55, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 172|Problem 172]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[continuum]] $M$ such that no [[monoto
    416 bytes (52 words) - 15:56, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 173|Problem 173]] ([[The Houston Problem Book|HPB]]):</strong> Do there exist, in the [[plane]], two [[simple curve|simpl
    519 bytes (74 words) - 15:57, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 174|Problem 174]] ([[The Houston Problem Book|HPB]]):</strong> In a [[topological space]] $(X,\tau)$, each set $A$ has it
    572 bytes (88 words) - 15:59, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 175|Problem 175]] ([[The Houston Problem Book|HPB]]):</strong> In how many ways can one put $k$ dominoes on an $n \times
    463 bytes (64 words) - 16:00, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 176|Problem 176]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X_1,x_2,X_3,\ldots$ is a sequence of positive num
    493 bytes (69 words) - 16:02, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 177|Problem 177]] ([[The Houston Problem Book|HPB]]):</strong> The equation $n!=m!k! (m>k)$ is solved for $n=10$, $m=7$,
    428 bytes (61 words) - 16:03, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 178|Problem 178]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist, for each $t \in \left( \dfrac{1}{2}, 1 \
    613 bytes (89 words) - 16:05, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 179|Problem 179]] ([[The Houston Problem Book|HPB]]):</strong> Is there a [[tree-like]] [[continuum]] $X$ on the [[plane]
    429 bytes (56 words) - 16:06, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 180|Problem 180]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is an [[arcwise connected]] [[continuum]] with
    585 bytes (85 words) - 16:07, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 181|Problem 181]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is an [[arcwise connected]] [[continuum]] with
    501 bytes (65 words) - 16:09, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 182|Problem 182]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $T$ and $T'$ are [[tree|trees]] with $T
    540 bytes (78 words) - 16:10, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 183|Problem 183]] ([[The Houston Problem Book|HPB]]):</strong> Let $R$ be a [[topological space|space]] having a [[topolo
    592 bytes (73 words) - 16:12, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 184|Problem 184]] ([[The Houston Problem Book|HPB]]):</strong> Does an [[open map|open mapping]] preserve [[span zero]] o
    402 bytes (49 words) - 16:12, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 185|Problem 185]] ([[The Houston Problem Book|HPB]]):</strong> Is the product of two [[unicoherent]] [[continuum|continua
    419 bytes (52 words) - 16:14, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 186|Problem 186]] ([[The Houston Problem Book|HPB]]):</strong> Characterize mappings $f \colon X \twoheadrightarrow Y$ su
    482 bytes (66 words) - 16:16, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 187|Problem 187]] ([[The Houston Problem Book|HPB]]):</strong> Does the class of [[approximable]] mappings coincide with
    383 bytes (47 words) - 16:17, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 188|Problem 188]] ([[The Houston Problem Book|HPB]]):</strong> In each [[continuum]] of [[span zero]] [[continuously ray
    369 bytes (44 words) - 16:18, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 189|Problem 189]] ([[The Houston Problem Book|HPB]]):</strong> Does every [[strongly infinite-dimensional]] [[absolute G-
    537 bytes (59 words) - 16:19, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 190|Problem 190]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $A$ is a subset of the [[Euclidean spac
    583 bytes (85 words) - 16:21, 31 December 2015
  • Return to the [[The Houston Problem Book|Houston Problem Book Main Page]]. {{:Houston Problem Book Problem 151}}<br />
    2 KB (263 words) - 03:55, 30 November 2018
  • ...ng>[[Houston Problem Book Problem 191|Problem 191]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $A$ is a subset of $\mathbb{R}^n$, then
    664 bytes (99 words) - 16:23, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 192|Problem 192]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[hereditarily infinite-dimensional]] [
    418 bytes (47 words) - 16:24, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 193|Problem 193]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $X$ is a [[homogeneous]] finite-[[dimen
    485 bytes (58 words) - 16:25, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 194|Problem 194]] ([[The Houston Problem Book|HPB]]):</strong> Let $X$ be a [[homogeneous]] curve such that the [[rank]],
    462 bytes (61 words) - 16:26, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 195|Problem 195]] ([[The Houston Problem Book|HPB]]):</strong> Let $X_1,X_2,\ldots$ be an [[inverse sequence]] of [[polyh
    754 bytes (106 words) - 16:28, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 196|Problem 196]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[piecewise linear]] mapping $f$ of a [
    736 bytes (111 words) - 16:30, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 197|Problem 197]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[separable]] [[metric space]] $X$ whos
    491 bytes (63 words) - 16:32, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 198|Problem 198]] ([[The Houston Problem Book|HPB]]):</strong> Is the property of being [[weakly chainable]] a [[Whitney
    364 bytes (44 words) - 16:32, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 199|Problem 199]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ is a [[tree-like]] [[continuum]] (or a [[dendroid]]
    493 bytes (66 words) - 16:34, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 200|Problem 200]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that there do not exist [[expansive]] [[homeomo
    572 bytes (73 words) - 16:35, 31 December 2015
  • Return to the [[The Houston Problem Book|Houston Problem Book Main Page]]. {{:Houston Problem Book Problem 201}}<br />
    882 bytes (103 words) - 03:56, 30 November 2018
  • ...ng>[[Houston Problem Book Problem 201|Problem 201]] ([[The Houston Problem Book|HPB]]):</strong> If $C$ is a [[simple curve|simple]] [[closed curve|closed]
    558 bytes (75 words) - 16:38, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 202|Problem 202]] ([[The Houston Problem Book|HPB]]):</strong> Is each [[separable]] [[metric space|metric]], [[hereditar
    433 bytes (52 words) - 16:39, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 203|Problem 203]] ([[The Houston Problem Book|HPB]]):</strong> Can the space of [[homeomorphism|homeomorphisms]] of the [
    542 bytes (73 words) - 16:41, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 204|Problem 204]] ([[The Houston Problem Book|HPB]]):</strong> For [[separable]] [[metric space|metric spaces]], does [[c
    593 bytes (79 words) - 16:42, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 205|Problem 205]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[separable]] [[metric space]] and there
    593 bytes (79 words) - 16:44, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 206|Problem 206]] ([[The Houston Problem Book|HPB]]):</strong> Are the sets of all [[end point|end points]] and of all [[
    842 bytes (121 words) - 16:46, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 207|Problem 207]] ([[The Houston Problem Book|HPB]]):</strong> Can each $n$-[[dimension|dimensional]], where $n>1$, [[loc
    630 bytes (79 words) - 16:48, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 208|Problem 208]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is the [[inverse limit]] of a sequence of [[Ha
    643 bytes (90 words) - 16:51, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 209|Problem 209]] ([[The Houston Problem Book|HPB]]):</strong> Let $X$ be a [[Hausdorff]] space such that $X$ is a [[cont
    832 bytes (114 words) - 16:53, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 210|Problem 210]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[monotically normal]], [[compact]] space
    1 KB (136 words) - 16:56, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 211|Problem 211]] ([[The Houston Problem Book|HPB]]):</strong> Is each [[monotonically normal]], [[compact]] space a [[co
    428 bytes (50 words) - 16:57, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 212|Problem 212]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[monotonically normal]], [[separable]],
    639 bytes (84 words) - 16:58, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 213|Problem 213]] ([[The Houston Problem Book|HPB]]):</strong> Let $X$ be a [[dendron]]. Does there exist a [[hereditaril
    663 bytes (88 words) - 17:01, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 214|Problem 214]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[universal]] [[totally regular]] [[con
    386 bytes (45 words) - 17:01, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 215|Problem 215]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[continuous]] function $f$ defined on
    525 bytes (73 words) - 17:03, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 216|Problem 216]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[monotone]] [[retraction]] $r \colon D
    599 bytes (90 words) - 17:04, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 217|Problem 217]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist, for every integer $n>2$, a [[finite-dime
    623 bytes (84 words) - 17:06, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 218|Problem 218]] ([[The Houston Problem Book|HPB]]):</strong> Let $G$ be the $3$-[[dimension|dimensional]] unit cube in ...nly sporadically discussed at the topology seminar of whose $18$ year this book is record, more or less. (A. Lelek 15 May 1989)
    1 KB (185 words) - 17:10, 31 December 2015
  • {{:Pavel Pyrih Problem Book Problem 1}} {{:Pavel Pyrih Problem Book Problem 2}}
    3 KB (341 words) - 05:15, 6 January 2016
  • ...ut point|weak cut points]]? (E.E. Grace, 2 February 1972 [[Houston Problem Book Problem 22]])
    478 bytes (59 words) - 02:34, 6 January 2016
  • ...arcwise connected]]? (E.D. Tymchatyn, 26 September 1974, [[Houston Problem Book Problem 66]])
    456 bytes (56 words) - 02:35, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 33|Problem 33]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Let a [[hereditarily unicoherent]] [[continuum]] $X$ have
    793 bytes (103 words) - 02:42, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 34|Problem 34]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> What mappings among [[hereditarily unicoherent]] [[contin
    739 bytes (89 words) - 04:20, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 35|Problem 35]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Let each nonconstant [[open mapping]] on an [[arcwise con
    587 bytes (80 words) - 04:21, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 36|Problem 36]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> All [[dendrite|dendrites]] which are [[homeomorphism|home
    669 bytes (88 words) - 04:23, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 37|Problem 37]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Does every [[chain]] of [[dendrite|dendrites]] with respe
    652 bytes (85 words) - 04:25, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 38|Problem 38]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Does there exist a sequence $\{X_n \colon n \in \mathbb{N
    571 bytes (78 words) - 04:27, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 39|Problem 39]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Does there exist a [[nondegenerate]] [[arcwise connected]
    477 bytes (57 words) - 04:28, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 40|Problem 40]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Is the [[locally monotone]] image of a [[WAO dendroid|$WA
    455 bytes (55 words) - 04:30, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 41|Problem 41]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Does every [[bounded]] [[chain]] of [[dendrite|dendrites]
    612 bytes (81 words) - 04:32, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 42|Problem 42]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Does every [[bounded]] [[chain]] of [[dendrite|dendrites]
    600 bytes (78 words) - 04:33, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 43|Problem 43]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> One infinite decreasing sequence of [[dendrite|dendrites]
    516 bytes (70 words) - 04:35, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 44|Problem 44]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Find an infintie decreasing sequence of ([[smooth]]) [[fa
    354 bytes (42 words) - 04:35, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 45|Problem 45]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> When each nonconstant [[open map|open]] [[strongly monoto
    476 bytes (60 words) - 04:38, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 46|Problem 46]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Does the [[uniform continuum-chainability]] of a [[contin
    620 bytes (74 words) - 04:39, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 47|Problem 47]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Identify the [[semilattice|semilattices]] that are [[isom
    553 bytes (69 words) - 04:41, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 48|Problem 48]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Is there a [[scattered]] [[Valdivia]] [[compact]] space w
    386 bytes (46 words) - 04:42, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 49|Problem 49]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Has each [[openly minimal]] [[dendrite]] at most $2$ [[no
    538 bytes (68 words) - 04:43, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 50|Problem 50]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Find all [[monotone-homogeneous]] [[dendrite|dendrites]].
    357 bytes (39 words) - 04:44, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 51|Problem 51]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Does there exist an infinite sequence of [[dendrite|dendr
    422 bytes (50 words) - 04:45, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 52|Problem 52]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Let $X$ be a [[continuum]], [[dimension|$\mathrm{dim}(X)$
    470 bytes (60 words) - 04:46, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 53|Problem 53]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Does there exist a [[model]] for all [[planar]] [[arcwise
    393 bytes (46 words) - 04:47, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 54|Problem 54]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Find a "good" characterization of being an [[arc-like]] [
    370 bytes (43 words) - 04:48, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 55|Problem 55]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Let $X$ be a [[chainable]] [[continuum]] with a [[mean]].
    381 bytes (48 words) - 04:49, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 56|Problem 56]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Let $X$ be a [[dendroid]] with the [[property of Kelley]]
    394 bytes (51 words) - 04:49, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 57|Problem 57]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Does there exist a [[homogeneous]] [[continuum]] with the
    417 bytes (49 words) - 04:50, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 58|Problem 58]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Find a topological characterization of the [[Sierpinski t
    367 bytes (42 words) - 04:51, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 59|Problem 59]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Let $M$ be a [[continuum]] such that if $\mathcal{G}$ is
    647 bytes (82 words) - 04:53, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 60|Problem 60]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Let $X$ be a [[continuum]]. Let $F_n(X)=\{A \subset X, A
    505 bytes (71 words) - 04:54, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 61|Problem 61]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Let $X$ be a [[continuum]]. Must $X$ be [[homeomorphism|h
    416 bytes (51 words) - 04:55, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 62|Problem 62]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Find all [[locally connected]] [[continuum|continua]] $X$
    448 bytes (55 words) - 04:56, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 63|Problem 63]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> For a continuum $X$ and a subset $A \subset X$ denote $T(
    623 bytes (95 words) - 04:58, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 64|Problem 64]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Find all [[dendrite|dendrites]] which are [[homeomorphism
    414 bytes (48 words) - 04:58, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 65|Problem 65]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Is the [[planability]] of [[fan|fants]] preserved by [[op
    343 bytes (42 words) - 04:59, 6 January 2016
  • ...em 3]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 72]]
    293 bytes (34 words) - 05:01, 6 January 2016
  • ...em 4]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 72]]
    293 bytes (34 words) - 05:01, 6 January 2016
  • ...em 5]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 77]]
    293 bytes (34 words) - 05:02, 6 January 2016
  • ...em 6]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 79]]
    293 bytes (34 words) - 05:02, 6 January 2016
  • ...em 7]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 84]]
    293 bytes (34 words) - 05:02, 6 January 2016
  • ...em 8]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 90]]
    293 bytes (34 words) - 05:03, 6 January 2016
  • ...em 9]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 96]]
    293 bytes (34 words) - 05:03, 6 January 2016
  • ...m 10]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 97]]
    295 bytes (34 words) - 05:04, 6 January 2016
  • ...m 11]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 101]]
    296 bytes (34 words) - 05:04, 6 January 2016
  • ...m 12]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 104]]
    296 bytes (34 words) - 05:05, 6 January 2016
  • ...m 13]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 106]]
    296 bytes (34 words) - 05:05, 6 January 2016
  • ...m 14]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 107]]
    296 bytes (34 words) - 05:06, 6 January 2016
  • ...m 15]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 113]]
    296 bytes (34 words) - 05:06, 6 January 2016
  • ...m 16]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 119]]
    296 bytes (34 words) - 05:07, 6 January 2016
  • ...m 17]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 123]]
    296 bytes (34 words) - 05:07, 6 January 2016
  • ...m 18]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 131]]
    296 bytes (34 words) - 05:07, 6 January 2016
  • ...m 19]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 135]]
    296 bytes (34 words) - 05:08, 6 January 2016
  • ...m 20]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 137]]
    296 bytes (34 words) - 05:08, 6 January 2016
  • ...m 21]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 150]]
    296 bytes (34 words) - 05:09, 6 January 2016
  • ...m 22]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 151]]
    296 bytes (34 words) - 05:09, 6 January 2016
  • ...m 23]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 155]]
    296 bytes (34 words) - 05:10, 6 January 2016
  • ...m 24]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 156]]
    296 bytes (34 words) - 05:10, 6 January 2016
  • ...m 25]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 168]]
    296 bytes (34 words) - 05:10, 6 January 2016
  • ...m 26]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 171]]
    296 bytes (34 words) - 05:11, 6 January 2016
  • ...m 27]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 172]]
    296 bytes (34 words) - 05:11, 6 January 2016
  • ...m 28]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 174]]
    296 bytes (34 words) - 05:11, 6 January 2016
  • ...m 29]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 179]]
    296 bytes (34 words) - 05:12, 6 January 2016
  • ...m 30]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 181]]
    296 bytes (34 words) - 05:12, 6 January 2016
  • ...m 31]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 215]]
    296 bytes (34 words) - 05:13, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 32|Problem 32]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Does there exist a [[weakly Suslinean]], [[locally connec
    496 bytes (61 words) - 05:14, 6 January 2016
  • {{Book|Continuum Theory, an Introduction|1992|Chapman & Hall||Sam B. Nadler, Jr.}} [[Category:Book]]
    219 bytes (23 words) - 03:20, 24 December 2018

Page text matches

  • ...tion on [[Problems]] such as a full transcription of [[The Houston Problem Book]], and follow our [https://twitter.com/hyperspacewiki Twitter]. | [[The Houston Problem Book]]
    2 KB (314 words) - 02:50, 24 December 2018
  • [http://web.mst.edu/~ingram/hpb.pdf The Houston Problem Book] (pdf)<br /> [[The Houston Problem Book]] (wiki)
    3 KB (460 words) - 15:16, 23 December 2018
  • <strong>[[Houston Problem Book Problem 6|Problem 6]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that a [[chainable]] [[continuum]] be [[embed|e
    504 bytes (72 words) - 22:23, 30 December 2015
  • ...''isomorphic'' to $G_2$, written $G_1 \cong G_2$.<ref>Pinter, Charles C. A Book of Abstract Algebra. Dover ed. Mineola, N.Y: Dover Publications, 2010.</ref
    757 bytes (102 words) - 06:13, 29 November 2018
  • {{Book|Several Old and New Problems in Continuum Theory|2000|Topology Proceedings|
    542 bytes (65 words) - 15:27, 23 December 2018
  • {{Book|A hereditarily indecomposable tree-like continuum without the fixed point p
    343 bytes (39 words) - 15:32, 23 December 2018
  • ...e say that $H$ is a ''homomorphic image'' of $G$.<ref>Pinter, Charles C. A Book of Abstract Algebra. Dover ed. Mineola, N.Y: Dover Publications, 2010.</ref
    768 bytes (106 words) - 05:47, 29 November 2018
  • ...ed the problems in the [http://web.mst.edu/~ingram/hpb.pdf Houston Problem Book] here.<ref>Cuchta, Tom. 2015. [http://tomcuchta.com/]</ref> | [[The Houston Problem Book Problems 1-50|The Houston Problem Book Problem Set]]
    1 KB (128 words) - 05:30, 30 November 2018
  • {{Book|On hit-and-miss hyperspace topologies|1993|Commentationes Mathematicae Univ
    449 bytes (55 words) - 04:33, 21 December 2017
  • {{Book|Hyperspaces, Fundamentals and Recent Advances|1999|Marcel Dekker||Alejandro [[Category:Book]]
    8 KB (903 words) - 04:32, 21 December 2017
  • <strong>[[Houston Problem Book Problem 2|Problem 2]] ([[The Houston Problem Book|HPB]]): </strong> Suppose $X$ is a [[continuum]] such that for each positiv
    713 bytes (99 words) - 01:51, 26 November 2016
  • <strong>[[Houston Problem Book Problem 1|Problem 1]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[continuum]] which cannot be [[Embedding
    547 bytes (75 words) - 01:07, 27 June 2016
  • <strong>[[Houston Problem Book Problem 19|Problem 19]] ([[The Houston Problem Book|HPB]]):</strong> Does each [[strictly non-mutually aposyndetic]] [[continuu
    561 bytes (69 words) - 02:22, 31 December 2015
  • <strong>[[Houston Problem Book Problem 17|Problem 17]] ([[The Houston Problem Book|HPB]]):</strong> Is there a [[topological space]] $(X,\tau)$ on which the [
    490 bytes (63 words) - 01:40, 31 December 2015
  • <strong>[[Houston Problem Book Problem 15|Problem 15]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is an [[open map|open mapping]] of a [[compact
    621 bytes (89 words) - 23:34, 30 December 2015
  • <strong>[[Houston Problem Book Problem 13|Problem 13]] ([[The Houston Problem Book|HPB]]):</strong> Is the [[product]] of two [[strongly Hurewicz]] [[metric s
    398 bytes (49 words) - 22:58, 30 December 2015
  • <strong>[[Houston Problem Book Problem 11|Problem 11]] ([[The Houston Problem Book|HPB]]):</strong> Is each [[strongly Hurewicz]] space an [[absolute F sigma|
    483 bytes (64 words) - 22:49, 30 December 2015
  • <strong>[[Houston Problem Book Problem 5|Problem 5]] ([[The Houston Problem Book|HPB]]):</strong> Can every [[hereditarily decomposable]] [[Chainable contin
    521 bytes (67 words) - 01:57, 26 November 2016
  • <strong>[[Houston Problem Book Problem 4|Problem 4]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ is a [[Suslinean]] curve, does there exist a [[coun
    456 bytes (59 words) - 21:52, 30 December 2015
  • <strong>[[Houston Problem Book Problem 3|Problem 3]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ is a [[continuum]] such that every [[subcontinuum]]
    491 bytes (65 words) - 22:24, 30 December 2015
  • <strong>[[Houston Problem Book Problem 9|Problem 9]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[real curve]] which can be mapped [[Su
    605 bytes (81 words) - 04:32, 30 November 2018
  • <strong>[[Houston Problem Book Problem 8|Problem 8]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[rational]] curve which topologically
    457 bytes (57 words) - 22:39, 30 December 2015
  • <strong>[[Houston Problem Book Problem 7|Problem 7]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that the [[rim-type]] of any [[real curve]] (or
    459 bytes (61 words) - 22:29, 30 December 2015
  • [[Houston Problem Book Problem 7]]<br />
    185 bytes (28 words) - 22:32, 30 December 2015
  • [[Houston Problem Book Problem 7]]<br />
    194 bytes (28 words) - 22:32, 30 December 2015
  • [[Houston Problem Book Problem 7]]
    312 bytes (54 words) - 22:36, 30 December 2015
  • [[Houston Problem Book Problem 9]]<br />
    189 bytes (26 words) - 22:43, 30 December 2015
  • <strong>[[Houston Problem Book Problem 10|Problem 10]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $D$ is a [[dendroid]], $S$ is [[compact]], [[finit
    656 bytes (85 words) - 04:33, 30 November 2018
  • [[Houston Problem Book Problem 10]]
    46 bytes (6 words) - 22:46, 30 December 2015
  • [[Houston Problem Book Problem 11]]<br />
    483 bytes (85 words) - 22:55, 30 December 2015
  • <strong>[[Houston Problem Book Problem 12|Problem 12]] ([[The Houston Problem Book|HPB]]):</strong> Is each [[product]] of two [[Hurewicz]] [[metric space|met
    409 bytes (51 words) - 22:56, 30 December 2015
  • <strong>[[Houston Problem Book Problem 14|Problem 14]] ([[The Houston Problem Book|HPB]]):</strong> Is every [[Lindelöf]] [[totally paracompact]] space [[Hur
    364 bytes (43 words) - 23:02, 30 December 2015
  • * [[Houston Problem Book Problem 14]]
    460 bytes (59 words) - 07:05, 1 December 2018
  • [[Houston Problem Book Problem 14]]<br />
    247 bytes (38 words) - 23:30, 30 December 2015
  • [[Houston Problem Book Problem 15]]<br />
    287 bytes (35 words) - 23:37, 30 December 2015
  • <strong>[[Houston Problem Book Problem 16|Problem 16]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[locally confluent]] and [[light]] mappi
    637 bytes (90 words) - 23:41, 30 December 2015
  • [[Houston Problem Book Problem 16]]<br />
    320 bytes (53 words) - 00:52, 31 December 2015
  • [[Houston Problem Book Problem 17]]<br />
    103 bytes (15 words) - 01:41, 31 December 2015
  • <strong>[[Houston Problem Book Problem 18|Problem 18]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that each [[open mapping]] of a [[continuum]] $
    522 bytes (71 words) - 02:17, 31 December 2015
  • <strong>[[Houston Problem Book Problem 20|Problem 20]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is an [[open map|open]] [[continuous]] mapping
    825 bytes (131 words) - 02:54, 31 December 2015
  • <strong>[[Houston Problem Book Problem 21|Problem 21]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ is a [[planar]] [[continuum]] which has only a fini
    551 bytes (73 words) - 06:01, 31 December 2015
  • <strong>[[Houston Problem Book Problem 22|Problem 22]] ([[The Houston Problem Book|HPB]]):</strong> Does every totally non-[[semi-locally connected]] [[contin
    447 bytes (57 words) - 06:03, 31 December 2015
  • <strong>[[Houston Problem Book Problem 23|Problem 23]] ([[The Houston Problem Book|HPB]]):</strong> Does every totally non-[[semi-locally connected]] [[bicomp
    417 bytes (49 words) - 06:04, 31 December 2015
  • <strong>[[Houston Problem Book Problem 24|Problem 24]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $X$ is a [[simple tree]] and the [[widt
    472 bytes (68 words) - 06:06, 31 December 2015
  • <strong>[[Houston Problem Book Problem 25|Problem 25]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[tree-like]] [[continuum]], its [[width]
    567 bytes (87 words) - 06:08, 31 December 2015
  • <strong>[[Houston Problem Book Problem 26|Problem 26]] ([[The Houston Problem Book|HPB]]):</strong> Let $M$ be a [[locally compact]] [[metric space]] and $a \
    737 bytes (113 words) - 06:10, 31 December 2015
  • <strong>[[Houston Problem Book Problem 27|Problem 27]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is an $n$-[[dimension|dimensional]] [[compact]
    620 bytes (93 words) - 06:12, 31 December 2015
  • <strong>[[Houston Problem Book Problem 28|Problem 28]] ([[The Houston Problem Book|HPB]]):</strong> Prove that the [[Topologist's sine curve]] is not [[pseudo
    395 bytes (46 words) - 06:14, 31 December 2015
  • <strong>[[Houston Problem Book Problem 29|Problem 29]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a $1$-[[dimension|dimensional]] [[continu
    424 bytes (49 words) - 06:15, 31 December 2015
  • <strong>[[Houston Problem Book Problem 30|Problem 30]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ and $Y$ are [[Continuum|continua]] (or even [[
    683 bytes (97 words) - 04:45, 30 November 2018
  • <strong>[[Houston Problem Book Problem 31|Problem 31]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that the [[pseudo-arc]] is not [[pseudo-contrac
    366 bytes (43 words) - 06:18, 31 December 2015
  • <strong>[[Houston Problem Book Problem 32|Problem 32]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a mapping $f$ of the [[circle]] or the [[
    609 bytes (85 words) - 06:59, 31 December 2015
  • <strong>[[Houston Problem Book Problem 33|Problem 33]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $P$ is a subset of the positive integers with the
    688 bytes (104 words) - 04:42, 30 November 2018
  • <strong>[[Houston Problem Book Problem 34|Problem 34]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $f$ is a [[Function|mapping]] of a [[tr
    519 bytes (72 words) - 04:47, 30 November 2018
  • <strong>[[Houston Problem Book Problem 35|Problem 35]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[continuous]] mapping of a [[Continuum|c
    715 bytes (107 words) - 04:49, 30 November 2018
  • <strong>[[Houston Problem Book Problem 36|Problem 36]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[weakly confluent]] and [[locally conflu
    575 bytes (81 words) - 07:05, 31 December 2015
  • <strong>[[Houston Problem Book Problem 37|Problem 37]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $(X, \leq)$ is a finite [[Partially Ordered Set|pa
    904 bytes (137 words) - 04:55, 30 November 2018
  • ...The Houston Problem Book|HPB]]):</strong> Suppose $X$ in [[Houston Problem Book Problem 37|HPB Problem 37]] is $A \cup B$, where $A$ and $B$ are [[closed]]
    506 bytes (72 words) - 08:11, 31 December 2015
  • <strong>[[Houston Problem Book Problem 39|Problem 39]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a finite [[partially ordered set]] with the
    403 bytes (51 words) - 08:12, 31 December 2015
  • <strong>[[Houston Problem Book Problem 40|Problem 40]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a nonseparating ([[locally compact]]) sub
    565 bytes (76 words) - 08:13, 31 December 2015
  • <strong>[[Houston Problem Book Problem 41|Problem 41]] ([[The Houston Problem Book|HPB]]):</strong> Suppose that the [[plane]] is the union of two [[disjoint]
    530 bytes (73 words) - 09:35, 31 December 2015
  • <strong>[[Houston Problem Book Problem 42|Problem 42]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[compact]] [[metric space]] and $S$ is t
    609 bytes (93 words) - 09:37, 31 December 2015
  • <strong>[[Houston Problem Book Problem 43|Problem 43]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a curve that is [[contractible]], or [[pseu
    524 bytes (66 words) - 09:39, 31 December 2015
  • <strong>[[Houston Problem Book Problem 44|Problem 44]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[metric space]]; does [[superstable]] in
    372 bytes (46 words) - 09:40, 31 December 2015
  • <strong>[[Houston Problem Book Problem 45|Problem 45]] ([[The Houston Problem Book|HPB]]):</strong> It is true that if $Y$ is an [[arcwise connected]] [[conti
    567 bytes (75 words) - 09:43, 31 December 2015
  • <strong>[[Houston Problem Book Problem 46|Problem 46]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $Y$ is a [[compact]] [[metric space]] such that th
    497 bytes (66 words) - 09:44, 31 December 2015
  • <strong>[[Houston Problem Book Problem 47|Problem 47]] ([[The Houston Problem Book|HPB]]):</strong> Do [[atomic mapping|atomic mappings]] preserve [[semi-apos
    513 bytes (61 words) - 09:46, 31 December 2015
  • <strong>[[Houston Problem Book Problem 48|Problem 48]] ([[The Houston Problem Book|HPB]]):</strong> Is each [[unicoherent]] and [[mutually aposyndetic]] [[con
    481 bytes (58 words) - 09:48, 31 December 2015
  • <strong>[[Houston Problem Book Problem 49|Problem 49]] ([[The Houston Problem Book|HPB]]):</strong> Supppose $f$ is an [[open map|open mapping]] of a [[contin
    532 bytes (79 words) - 09:50, 31 December 2015
  • <strong>[[Houston Problem Book Problem 50|Problem 50]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[weakly confluent]] mapping of a [[conti
    493 bytes (70 words) - 09:51, 31 December 2015
  • <strong>[[Houston Problem Book Problem 51|Problem 51]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that each [[polyhedron]] is a the [[weakly conf
    419 bytes (53 words) - 09:54, 31 December 2015
  • <strong>[[Houston Problem Book Problem 52|Problem 52]] ([[The Houston Problem Book|HPB]]):</strong> Are [[strongly regular]] curves [[inverse limit|inverse li
    481 bytes (58 words) - 09:55, 31 December 2015
  • <strong>[[Houston Problem Book Problem 53|Problem 53]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ is the [[inverse limit]] of [[connected]] [[graph|g
    515 bytes (65 words) - 09:56, 31 December 2015
  • <strong>[[Houston Problem Book Problem 54|Problem 54]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that $X$ is the [[inverse limit]] of [[connecte
    554 bytes (75 words) - 09:57, 31 December 2015
  • <strong>[[Houston Problem Book Problem 55|Problem 55]] ([[The Houston Problem Book|HPB]]):</strong> Does each [[continuous]] mapping of a [[continuum]] [[onto
    424 bytes (52 words) - 09:59, 31 December 2015
  • <strong>[[Houston Problem Book Problem 56|Problem 56]] ([[The Houston Problem Book|HPB]]):</strong> Does each [[weakly confluent]] mapping of a [[continuum]]
    433 bytes (53 words) - 10:00, 31 December 2015
  • <strong>[[Houston Problem Book Problem 57|Problem 57]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that each [[uniformly pathwise connected]] [[co
    403 bytes (47 words) - 10:01, 31 December 2015
  • <strong>[[Houston Problem Book Problem 58|Problem 58]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[continuous]] mapping of a [[chainable c
    578 bytes (80 words) - 10:03, 31 December 2015
  • <strong>[[Houston Problem Book Problem 59|Problem 59]] ([[The Houston Problem Book|HPB]]):</strong> Does a [[continuum]] with zero [[surjective span]] have [[
    356 bytes (43 words) - 10:04, 31 December 2015
  • <strong>[[Houston Problem Book Problem 60|Problem 60]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $Y=G_1 \cup G_2$ where $G_1$ and $G_2$
    516 bytes (73 words) - 10:06, 31 December 2015
  • <strong>[[Houston Problem Book Problem 61|Problem 61]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $\mathcal{E}$ is the class of all finite one point
    861 bytes (129 words) - 10:11, 31 December 2015
  • <strong>[[Houston Problem Book Problem 62|Problem 62]] ([[The Houston Problem Book|HPB]]):</strong> Are all [[shape|shapes]] of [[polyhedra]] [[stable]]? (Ask
    347 bytes (41 words) - 10:12, 31 December 2015
  • <strong>[[Houston Problem Book Problem 63|Problem 63]] ([[The Houston Problem Book|HPB]]):</strong> Given a [[polyhedron]] $P$, does there exist a polyhedron
    406 bytes (53 words) - 10:13, 31 December 2015
  • <strong>[[Houston Problem Book Problem 64|Problem 64]] ([[The Houston Problem Book|HPB]]):</strong> Is each [[uniformly path-connected]] [[continuum]] [[g-con
    379 bytes (42 words) - 10:14, 31 December 2015
  • <strong>[[Houston Problem Book Problem 65|Problem 65]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that, for each [[uniformly path-connected]] [[c
    537 bytes (74 words) - 10:15, 31 December 2015
  • <strong>[[Houston Problem Book Problem 66|Problem 66]] ([[The Houston Problem Book|HPB]]):</strong> If $C$ is a [[connected]] [[Borel set|Borel subset]] of a
    503 bytes (65 words) - 10:16, 31 December 2015
  • <strong>[[Houston Problem Book Problem 67|Problem 67]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[continuum]] such that, if $C$ is a [[su
    606 bytes (84 words) - 10:18, 31 December 2015
  • <strong>[[Houston Problem Book Problem 68|Problem 68]] ([[The Houston Problem Book|HPB]]):</strong> If for each [[subcontinuum]] $C$ of the [[continuum]] $X$,
    508 bytes (67 words) - 10:19, 31 December 2015
  • <strong>[[Houston Problem Book Problem 69|Problem 69]] ([[The Houston Problem Book|HPB]]):</strong> Do [[hereditarily indecomposable]] [[tree-like]] [[continu
    402 bytes (45 words) - 10:20, 31 December 2015
  • <strong>[[Houston Problem Book Problem 70|Problem 70]] ([[The Houston Problem Book|HPB]]):</strong> Do [[uniquely lambda-connected|uniquely $\lambda$-connecte
    505 bytes (55 words) - 10:21, 31 December 2015
  • <strong>[[Houston Problem Book Problem 71|Problem 71]] ([[The Houston Problem Book|HPB]]):</strong> Suppose that $X$ is a [[continuum]] such that, if $\epsilo
    754 bytes (108 words) - 10:24, 31 December 2015
  • <strong>[[Houston Problem Book Problem 72|Problem 72]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[continuum]] such that each [[sigma-conn
    443 bytes (53 words) - 10:25, 31 December 2015
  • <strong>[[Houston Problem Book Problem 73|Problem 73]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[continuum]] such that each [[sigma-conn
    474 bytes (58 words) - 10:26, 31 December 2015
  • <strong>[[Houston Problem Book Problem 74|Problem 74]] ([[The Houston Problem Book|HPB]]):</strong> Let $f$ be a [[perfect]] [[pseudo-confluent]] mapping of a
    702 bytes (85 words) - 10:29, 31 December 2015
  • <strong>[[Houston Problem Book Problem 75|Problem 75]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[separable]] [[metric space]] which poss
    617 bytes (85 words) - 10:30, 31 December 2015
  • <strong>[[Houston Problem Book Problem 76|Problem 76]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[separable]] [[metric space]] such that,
    535 bytes (82 words) - 10:31, 31 December 2015
  • <strong>[[Houston Problem Book Problem 77|Problem 77]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that a [[continuum]] $X$ is [[regular]] if and
    459 bytes (62 words) - 10:32, 31 December 2015
  • <strong>[[Houston Problem Book Problem 78|Problem 78]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that, for each [[decomposition]] of a [[finitel
    521 bytes (65 words) - 10:34, 31 December 2015
  • <strong>[[Houston Problem Book Problem 79|Problem 79]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that no [[biconnected]] set with a [[dispersion
    423 bytes (53 words) - 10:35, 31 December 2015
  • <strong>[[Houston Problem Book Problem 80|Problem 80]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that a [[separable]] [[metric space]] is [[embe
    543 bytes (70 words) - 10:36, 31 December 2015
  • Return to the [[The Houston Problem Book|Houston Problem Book Main Page]]. {{:Houston Problem Book Problem 1}}<br />
    2 KB (263 words) - 03:52, 30 November 2018
  • <strong>[[Houston Problem Book Problem 81|Problem 81]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that each [[continuum]] of [[span zero]] [[chai
    367 bytes (47 words) - 10:38, 31 December 2015
  • <strong>[[Houston Problem Book Problem 82|Problem 82]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that each [[continuum]] of [[surjective semi-sp
    366 bytes (45 words) - 10:39, 31 December 2015
  • <strong>[[Houston Problem Book Problem 83|Problem 83]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[connected]] [[metric space]].
    710 bytes (109 words) - 10:40, 31 December 2015
  • <strong>[[Houston Problem Book Problem 84|Problem 84]] ([[The Houston Problem Book|HPB]]):</strong> Is the [[confluent]] image of an [[arc-like]] [[continuum]
    362 bytes (43 words) - 10:41, 31 December 2015
  • <strong>[[Houston Problem Book Problem 85|Problem 85]] ([[The Houston Problem Book|HPB]]):</strong> If $f$ is a [[confluent]] mapping of an [[acyclic]] (or [[
    450 bytes (57 words) - 10:42, 31 December 2015
  • Return to the [[The Houston Problem Book|Houston Problem Book Main Page]]. {{:Houston Problem Book Problem 51}}<br />
    2 KB (263 words) - 03:53, 30 November 2018
  • <strong>[[Houston Problem Book Problem 86|Problem 86]] ([[The Houston Problem Book|HPB]]):</strong> Do [[confluent]] maps of [[continuum|continua]] preserve [
    376 bytes (46 words) - 10:46, 31 December 2015
  • <strong>[[Houston Problem Book Problem 87|Problem 87]] ([[The Houston Problem Book|HPB]]):</strong> Is every [[regularly submetrizable]] [[Moore space]] [[com
    368 bytes (42 words) - 10:46, 31 December 2015
  • <strong>[[Houston Problem Book Problem 88|Problem 88]] ([[The Houston Problem Book|HPB]]):</strong> Is every [[homogeneous]] [[continuum]] [[bihomogeneous]]?
    382 bytes (42 words) - 10:47, 31 December 2015
  • <strong>[[Houston Problem Book Problem 89|Problem 89]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[noncombinatorial triangulation]] of t
    382 bytes (45 words) - 10:48, 31 December 2015
  • <strong>[[Houston Problem Book Problem 90|Problem 90]] ([[The Houston Problem Book|HPB]]):</strong> Is there a [[hereditarily equivalent]] [[continuum]] other
    387 bytes (47 words) - 10:49, 31 December 2015
  • <strong>[[Houston Problem Book Problem 91|Problem 91]] ([[The Houston Problem Book|HPB]]):</strong> Do [[hereditarily equivalent]] [[continuum|continua]] have
    365 bytes (42 words) - 10:50, 31 December 2015
  • <strong>[[Houston Problem Book Problem 92|Problem 92]] ([[The Houston Problem Book|HPB]]):</strong> If $M$ is a [[continuum]] with [[positive span]] such that
    576 bytes (75 words) - 10:51, 31 December 2015
  • <strong>[[Houston Problem Book Problem 93|Problem 93]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[homogeneous]] [[tree-like]] [[continu
    440 bytes (56 words) - 10:52, 31 December 2015
  • <strong>[[Houston Problem Book Problem 94|Problem 94]] ([[The Houston Problem Book|HPB]]):</strong> If $M$ is a [[plane continuum]] with no [[weak cut point]]
    507 bytes (65 words) - 10:53, 31 December 2015
  • <strong>[[Houston Problem Book Problem 95|Problem 95]] ([[The Houston Problem Book|HPB]]):</strong> Is the [[countable]] [[product]] of [[lambda-connected|$\l
    518 bytes (65 words) - 10:54, 31 December 2015
  • <strong>[[Houston Problem Book Problem 96|Problem 96]] ([[The Houston Problem Book|HPB]]):</strong> Is the image under a [[local homeomorphism]] of a [[delta-
    423 bytes (51 words) - 10:55, 31 December 2015
  • <strong>[[Houston Problem Book Problem 97|Problem 97]] ([[The Houston Problem Book|HPB]]):</strong> Can it be proven, without extraordinary logical assumption
    658 bytes (87 words) - 10:57, 31 December 2015
  • <strong>[[Houston Problem Book Problem 98|Problem 98]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $(X,\tau_1)$ is [[normal]], $(X,\tau_2)
    523 bytes (71 words) - 10:58, 31 December 2015
  • <strong>[[Houston Problem Book Problem 99|Problem 99]] ([[The Houston Problem Book|HPB]]):</strong> Is the [[Sorgenfrey line]] [[totally paracompact]]? (Asked
    375 bytes (44 words) - 10:59, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 100|Problem 100]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[light]] [[open mapping]] from a [[conti
    678 bytes (101 words) - 11:01, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 101|Problem 101]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is a [[continuum]] and $f$ is a [[monotone]] m
    547 bytes (79 words) - 11:05, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 102|Problem 102]] ([[The Houston Problem Book|HPB]]):</strong> Is there a non-[[locally connected]] [[continuum]] $M$ suc
    523 bytes (75 words) - 11:07, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 103|Problem 103]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is a [[hereditarily unicoherent]] and [[heredi
    503 bytes (68 words) - 11:08, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 104|Problem 104]] ([[The Houston Problem Book|HPB]]):</strong> Is the [[open image]] of a [[circle-like]] [[continuum]] a
    390 bytes (47 words) - 14:14, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 105|Problem 105]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is an [[atriodic]] $1$-[[dimension|dimensional
    902 bytes (130 words) - 14:17, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 106|Problem 106]] ([[The Houston Problem Book|HPB]]):</strong> If $M$ is [[tree-like]] and every proper [[subcontinuum]]
    409 bytes (51 words) - 14:18, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 107|Problem 107]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M_1,M_2,\ldots$ is a sequence of mutually disjoin
    518 bytes (63 words) - 14:19, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 108|Problem 108]] ([[The Houston Problem Book|HPB]]):</strong> If $M$ is a [[uniquely arcwise connected]] [[continuum]],
    492 bytes (65 words) - 14:21, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 109|Problem 109]] ([[The Houston Problem Book|HPB]]):</strong> Do [[pointwise periodic]] [[homeomorphism|homeomorphisms]]
    434 bytes (51 words) - 14:21, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 110|Problem 110]] ([[The Houston Problem Book|HPB]]):</strong> Do [[disk-like]] [[continuum|continua]] have the [[fixed p
    441 bytes (52 words) - 14:23, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 111|Problem 111]] ([[The Houston Problem Book|HPB]]):</strong> If $M$ is a [[tree-like]] [[continuum]] with the [[fixed p
    425 bytes (54 words) - 14:24, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 112|Problem 112]] ([[The Houston Problem Book|HPB]]):</strong> If $M$ is a [[contractible]] [[continuum]], do [[periodic
    437 bytes (53 words) - 14:25, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 113|Problem 113]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is a [[continuum]] which is not the [[sum]] of
    465 bytes (60 words) - 14:26, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 114|Problem 114]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that, if $X$ is a [[compact]] [[metric space]],
    724 bytes (108 words) - 14:28, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 115|Problem 115]] ([[The Houston Problem Book|HPB]]):</strong> Does every [[atriodic]] $2$-[[dimension|dimensional]] [[co
    418 bytes (46 words) - 14:28, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 116|Problem 116]] ([[The Houston Problem Book|HPB]]):</strong> If $S$ is a [[compact]], [[uniquely divisible]], [[topolog
    465 bytes (55 words) - 14:30, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 117|Problem 117]] ([[The Houston Problem Book|HPB]]):</strong> Suppose that $M$ is a [[tree-like]] [[continuum]] such tha
    506 bytes (72 words) - 14:31, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 118|Problem 118]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $H$ and $K$ are two [[continuum|continua]] with [[
    462 bytes (60 words) - 14:32, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 119|Problem 119]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $Y$ is a [[nondegenerate]] [[locally connected]] [
    678 bytes (96 words) - 14:34, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 120|Problem 120]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is the 'canonical' [[Knaster indecomposable co
    555 bytes (72 words) - 14:35, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 121|Problem 121]] ([[The Houston Problem Book|HPB]]):</strong> Does every [[hereditarily decomposable]] [[continuum]] con
    502 bytes (59 words) - 14:38, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 122|Problem 122]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $n$ is a positive integer and $M$ is a [[continuum
    609 bytes (83 words) - 14:39, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 123|Problem 123]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[widely connected]] [[complete]] [[met
    362 bytes (43 words) - 14:40, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 124|Problem 124]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is the 'canonical' [[Knaster indecomposable co
    468 bytes (58 words) - 14:41, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 125|Problem 125]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[universal]] [[hereditarily indecompos
    411 bytes (49 words) - 14:42, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 126|Problem 126]] ([[The Houston Problem Book|HPB]]):</strong> If $M$ is a [[hereditarily indecomposable]] [[continuum]]
    756 bytes (110 words) - 14:44, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 127|Problem 127]] ([[The Houston Problem Book|HPB]]):</strong> Does a mapping of the [[plane]] [[into]] itself with [[bou
    549 bytes (72 words) - 14:46, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 128|Problem 128]] ([[The Houston Problem Book|HPB]]):</strong> Given $n>0$, is there a [[continuous]] image of the $(2n+1
    452 bytes (60 words) - 14:46, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 129|Problem 129]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[chainable]] [[continuum]] $M$ in the
    509 bytes (71 words) - 14:47, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 130|Problem 130]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that, if $X$ is a [[continuum]], $f$ is a mappi
    461 bytes (63 words) - 14:48, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 131|Problem 131]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is a [[continuum]] such that, if $G$ is an [[u
    622 bytes (81 words) - 14:51, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 132|Problem 132]] ([[The Houston Problem Book|HPB]]):</strong> Is there an [[atriodic]] [[tree-like]] [[continuum]] which
    447 bytes (56 words) - 14:52, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 133|Problem 133]] ([[The Houston Problem Book|HPB]]):</strong> If $M$ is an [[atriodic]] [[tree-like]] [[continuum]] in t
    566 bytes (73 words) - 14:53, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 134|Problem 134]] ([[The Houston Problem Book|HPB]]):</strong> Is there an [[atriodic]] [[tree-like]] [[continuum]] $M$ w
    569 bytes (74 words) - 14:54, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 135|Problem 135]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is a [[hereditarily indecomposable]] [[triod-l
    484 bytes (60 words) - 14:55, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 136|Problem 136]] ([[The Houston Problem Book|HPB]]):</strong> Given a set $X$ of $n$ points on the [[plane]], a line is
    686 bytes (107 words) - 15:03, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 137|Problem 137]] ([[The Houston Problem Book|HPB]]):</strong> Is there a [[monotonely refinable]] map from a [[regular c
    445 bytes (57 words) - 14:58, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 138|Problem 138]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist, for every $k \leq m \leq \omega$, a [[to
    495 bytes (73 words) - 14:59, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 139|Problem 139]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[Lindelöf]] space $X$ and a [[complet
    490 bytes (65 words) - 15:01, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 140|Problem 140]] ([[The Houston Problem Book|HPB]]):</strong> Is a [[para-Lindelöf]] space [[paracompact]]? (Asked by W
    359 bytes (45 words) - 15:04, 31 December 2015
  • Return to the [[The Houston Problem Book|Houston Problem Book Main Page]]. {{:Houston Problem Book Problem 101}}<br />
    2 KB (263 words) - 03:54, 30 November 2018
  • ...ng>[[Houston Problem Book Problem 141|Problem 141]] ([[The Houston Problem Book|HPB]]):</strong> Is a [[collectionwise normal]] space with a [[sigma-locall
    437 bytes (54 words) - 15:06, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 142|Problem 142]] ([[The Houston Problem Book|HPB]]):</strong> Is a [[sL-cwH]], [[metacompact]] space [[para-Lindelöf]]?
    371 bytes (46 words) - 15:07, 31 December 2015
  • [[Houston Problem Book Problem 142]]<br />
    362 bytes (51 words) - 15:09, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 143|Problem 143]] ([[The Houston Problem Book|HPB]]):</strong> Does a [[para-Lindelöf]] space with a [[base]] of [[count
    455 bytes (58 words) - 15:10, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 144|Problem 144]] ([[The Houston Problem Book|HPB]]):</strong> Is there an honest (i.e. provable from [[Zermelo–Fraenke
    591 bytes (77 words) - 15:13, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 145|Problem 145]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ has a [[sigma-disjoint|$\sigma$-disjoint]] [[base]]
    548 bytes (72 words) - 15:14, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 146|Problem 146]] ([[The Houston Problem Book|HPB]]):</strong> (1) $a(i)(\mod n(i)), n(1)<n(2)< \ldots < n(k)$, is called
    653 bytes (94 words) - 15:17, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 147|Problem 147]] ([[The Houston Problem Book|HPB]]):</strong> Let there be given $n$ points in the [[plane]], no $n-k$ o
    635 bytes (91 words) - 15:18, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 148|Problem 148]] ([[The Houston Problem Book|HPB]]):</strong> Let $G(n)$ be a [[graph]] of $n$ [[vertex|vertices]]. A th
    1 KB (185 words) - 15:21, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 149|Problem 149]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that the subset $E$ of the [[complex plane]] is
    524 bytes (76 words) - 15:23, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 150|Problem 150]] ([[The Houston Problem Book|HPB]]):</strong> Let $\mathcal{F}$ be a class of mappings such that all [[h
    1 KB (194 words) - 15:27, 31 December 2015
  • ...he Houston Problem Book|HPB]]):</strong> Suppose, in the [[Houston Problem Book Problem 151|previous problem]], $X$ is a [[homogeneous]] [[continuum]], $Y$
    898 bytes (141 words) - 15:30, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 152|Problem 152]] ([[The Houston Problem Book|HPB]]):</strong> Let $M_n$ be the [[lattice]] consisting of $0,1,$ and $n$
    618 bytes (85 words) - 15:32, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 153|Problem 153]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is a [[continuum]] and $f$ is a mapping of $M$
    523 bytes (76 words) - 15:33, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 154|Problem 154]] ([[The Houston Problem Book|HPB]]):</strong> Is the space of [[automorphism|automorphisms]] of the [[ps
    387 bytes (44 words) - 15:34, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 155|Problem 155]] ([[The Houston Problem Book|HPB]]):</strong> Are [[planar]] [[dendroid|dendroids]] [[weakly chainable]]
    363 bytes (40 words) - 15:35, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 156|Problem 156]] ([[The Houston Problem Book|HPB]]):</strong> Let $X$ is a [[nondegenerate]] [[homogeneous]] [[hereditar
    466 bytes (54 words) - 15:36, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 157|Problem 157]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a finite ([[countable]]) to one mapping f
    465 bytes (53 words) - 15:37, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 158|Problem 158]] ([[The Houston Problem Book|HPB]]):</strong> Let $X$ be a [[nondegenerate]] [[continuum]] such that the
    504 bytes (61 words) - 15:38, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 159|Problem 159]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[dendroid]] $D$ such that the set $E$
    489 bytes (66 words) - 15:39, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 160|Problem 160]] ([[The Houston Problem Book|HPB]]):</strong> Let $X$ be a [[continuum]] such that the [[cone over]] $X$
    457 bytes (58 words) - 15:40, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 161|Problem 161]] ([[The Houston Problem Book|HPB]]):</strong> If the set function $T$ is [[continuous]] for the [[Hausdo
    513 bytes (70 words) - 15:44, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 162|Problem 162]] ([[The Houston Problem Book|HPB]]):</strong> If $T$ is [[continuous]] for the ([[Hausdorff]]) [[continu
    522 bytes (69 words) - 15:43, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 163|Problem 163]] ([[The Houston Problem Book|HPB]]):</strong> If $T$ is [[continuous]] for $S$ and there is a point $p \
    432 bytes (58 words) - 15:45, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 164|Problem 164]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ and $Y$ are [[indecomposable]] [[continuum|continua
    445 bytes (59 words) - 15:45, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 165|Problem 165]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ and $Y$ are [[indecomposable]] [[continuum|continua
    455 bytes (61 words) - 15:46, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 166|Problem 166]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ is a [[compact]] [[metric space|metric]] [[continuu
    711 bytes (104 words) - 15:48, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 167|Problem 167]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is a non[[compact]] [[n-manifold|$n$-manifold]
    548 bytes (72 words) - 15:50, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 168|Problem 168]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[thin]] space with infinitely many poi
    485 bytes (66 words) - 15:51, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 169|Problem 169]] ([[The Houston Problem Book|HPB]]):</strong> Is every [[aposyndetic]], [[homogeneous]], $1$-[[dimension
    428 bytes (49 words) - 15:52, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 170|Problem 170]] ([[The Houston Problem Book|HPB]]):</strong> Do there exist even integer $i$ and $j$ such that, for eve
    737 bytes (119 words) - 15:54, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 171|Problem 171]] ([[The Houston Problem Book|HPB]]):</strong> Is every [[weakly chainable]] [[atriodic]] [[tree-like]] [
    380 bytes (42 words) - 15:55, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 172|Problem 172]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[continuum]] $M$ such that no [[monoto
    416 bytes (52 words) - 15:56, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 173|Problem 173]] ([[The Houston Problem Book|HPB]]):</strong> Do there exist, in the [[plane]], two [[simple curve|simpl
    519 bytes (74 words) - 15:57, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 174|Problem 174]] ([[The Houston Problem Book|HPB]]):</strong> In a [[topological space]] $(X,\tau)$, each set $A$ has it
    572 bytes (88 words) - 15:59, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 175|Problem 175]] ([[The Houston Problem Book|HPB]]):</strong> In how many ways can one put $k$ dominoes on an $n \times
    463 bytes (64 words) - 16:00, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 176|Problem 176]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X_1,x_2,X_3,\ldots$ is a sequence of positive num
    493 bytes (69 words) - 16:02, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 177|Problem 177]] ([[The Houston Problem Book|HPB]]):</strong> The equation $n!=m!k! (m>k)$ is solved for $n=10$, $m=7$,
    428 bytes (61 words) - 16:03, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 178|Problem 178]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist, for each $t \in \left( \dfrac{1}{2}, 1 \
    613 bytes (89 words) - 16:05, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 179|Problem 179]] ([[The Houston Problem Book|HPB]]):</strong> Is there a [[tree-like]] [[continuum]] $X$ on the [[plane]
    429 bytes (56 words) - 16:06, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 180|Problem 180]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is an [[arcwise connected]] [[continuum]] with
    585 bytes (85 words) - 16:07, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 181|Problem 181]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is an [[arcwise connected]] [[continuum]] with
    501 bytes (65 words) - 16:09, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 182|Problem 182]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $T$ and $T'$ are [[tree|trees]] with $T
    540 bytes (78 words) - 16:10, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 183|Problem 183]] ([[The Houston Problem Book|HPB]]):</strong> Let $R$ be a [[topological space|space]] having a [[topolo
    592 bytes (73 words) - 16:12, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 184|Problem 184]] ([[The Houston Problem Book|HPB]]):</strong> Does an [[open map|open mapping]] preserve [[span zero]] o
    402 bytes (49 words) - 16:12, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 185|Problem 185]] ([[The Houston Problem Book|HPB]]):</strong> Is the product of two [[unicoherent]] [[continuum|continua
    419 bytes (52 words) - 16:14, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 186|Problem 186]] ([[The Houston Problem Book|HPB]]):</strong> Characterize mappings $f \colon X \twoheadrightarrow Y$ su
    482 bytes (66 words) - 16:16, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 187|Problem 187]] ([[The Houston Problem Book|HPB]]):</strong> Does the class of [[approximable]] mappings coincide with
    383 bytes (47 words) - 16:17, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 188|Problem 188]] ([[The Houston Problem Book|HPB]]):</strong> In each [[continuum]] of [[span zero]] [[continuously ray
    369 bytes (44 words) - 16:18, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 189|Problem 189]] ([[The Houston Problem Book|HPB]]):</strong> Does every [[strongly infinite-dimensional]] [[absolute G-
    537 bytes (59 words) - 16:19, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 190|Problem 190]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $A$ is a subset of the [[Euclidean spac
    583 bytes (85 words) - 16:21, 31 December 2015
  • Return to the [[The Houston Problem Book|Houston Problem Book Main Page]]. {{:Houston Problem Book Problem 151}}<br />
    2 KB (263 words) - 03:55, 30 November 2018
  • ...ng>[[Houston Problem Book Problem 191|Problem 191]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $A$ is a subset of $\mathbb{R}^n$, then
    664 bytes (99 words) - 16:23, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 192|Problem 192]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[hereditarily infinite-dimensional]] [
    418 bytes (47 words) - 16:24, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 193|Problem 193]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $X$ is a [[homogeneous]] finite-[[dimen
    485 bytes (58 words) - 16:25, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 194|Problem 194]] ([[The Houston Problem Book|HPB]]):</strong> Let $X$ be a [[homogeneous]] curve such that the [[rank]],
    462 bytes (61 words) - 16:26, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 195|Problem 195]] ([[The Houston Problem Book|HPB]]):</strong> Let $X_1,X_2,\ldots$ be an [[inverse sequence]] of [[polyh
    754 bytes (106 words) - 16:28, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 196|Problem 196]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[piecewise linear]] mapping $f$ of a [
    736 bytes (111 words) - 16:30, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 197|Problem 197]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[separable]] [[metric space]] $X$ whos
    491 bytes (63 words) - 16:32, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 198|Problem 198]] ([[The Houston Problem Book|HPB]]):</strong> Is the property of being [[weakly chainable]] a [[Whitney
    364 bytes (44 words) - 16:32, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 199|Problem 199]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ is a [[tree-like]] [[continuum]] (or a [[dendroid]]
    493 bytes (66 words) - 16:34, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 200|Problem 200]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that there do not exist [[expansive]] [[homeomo
    572 bytes (73 words) - 16:35, 31 December 2015
  • Return to the [[The Houston Problem Book|Houston Problem Book Main Page]]. {{:Houston Problem Book Problem 201}}<br />
    882 bytes (103 words) - 03:56, 30 November 2018
  • ...ng>[[Houston Problem Book Problem 201|Problem 201]] ([[The Houston Problem Book|HPB]]):</strong> If $C$ is a [[simple curve|simple]] [[closed curve|closed]
    558 bytes (75 words) - 16:38, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 202|Problem 202]] ([[The Houston Problem Book|HPB]]):</strong> Is each [[separable]] [[metric space|metric]], [[hereditar
    433 bytes (52 words) - 16:39, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 203|Problem 203]] ([[The Houston Problem Book|HPB]]):</strong> Can the space of [[homeomorphism|homeomorphisms]] of the [
    542 bytes (73 words) - 16:41, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 204|Problem 204]] ([[The Houston Problem Book|HPB]]):</strong> For [[separable]] [[metric space|metric spaces]], does [[c
    593 bytes (79 words) - 16:42, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 205|Problem 205]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[separable]] [[metric space]] and there
    593 bytes (79 words) - 16:44, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 206|Problem 206]] ([[The Houston Problem Book|HPB]]):</strong> Are the sets of all [[end point|end points]] and of all [[
    842 bytes (121 words) - 16:46, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 207|Problem 207]] ([[The Houston Problem Book|HPB]]):</strong> Can each $n$-[[dimension|dimensional]], where $n>1$, [[loc
    630 bytes (79 words) - 16:48, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 208|Problem 208]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is the [[inverse limit]] of a sequence of [[Ha
    643 bytes (90 words) - 16:51, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 209|Problem 209]] ([[The Houston Problem Book|HPB]]):</strong> Let $X$ be a [[Hausdorff]] space such that $X$ is a [[cont
    832 bytes (114 words) - 16:53, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 210|Problem 210]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[monotically normal]], [[compact]] space
    1 KB (136 words) - 16:56, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 211|Problem 211]] ([[The Houston Problem Book|HPB]]):</strong> Is each [[monotonically normal]], [[compact]] space a [[co
    428 bytes (50 words) - 16:57, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 212|Problem 212]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[monotonically normal]], [[separable]],
    639 bytes (84 words) - 16:58, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 213|Problem 213]] ([[The Houston Problem Book|HPB]]):</strong> Let $X$ be a [[dendron]]. Does there exist a [[hereditaril
    663 bytes (88 words) - 17:01, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 214|Problem 214]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[universal]] [[totally regular]] [[con
    386 bytes (45 words) - 17:01, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 215|Problem 215]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[continuous]] function $f$ defined on
    525 bytes (73 words) - 17:03, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 216|Problem 216]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[monotone]] [[retraction]] $r \colon D
    599 bytes (90 words) - 17:04, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 217|Problem 217]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist, for every integer $n>2$, a [[finite-dime
    623 bytes (84 words) - 17:06, 31 December 2015
  • ...ng>[[Houston Problem Book Problem 218|Problem 218]] ([[The Houston Problem Book|HPB]]):</strong> Let $G$ be the $3$-[[dimension|dimensional]] unit cube in ...nly sporadically discussed at the topology seminar of whose $18$ year this book is record, more or less. (A. Lelek 15 May 1989)
    1 KB (185 words) - 17:10, 31 December 2015
  • ...blems in continuum theory|OPICT]]):</strong> Let $B_3$ be the [[3-book|$3$-book]]. Does $B_3$ admit a [[continuous decomposition]] into [[pseudo-arc|pseudo
    400 bytes (47 words) - 11:09, 5 January 2016
  • {{:Pavel Pyrih Problem Book Problem 1}} {{:Pavel Pyrih Problem Book Problem 2}}
    3 KB (341 words) - 05:15, 6 January 2016
  • ...ut point|weak cut points]]? (E.E. Grace, 2 February 1972 [[Houston Problem Book Problem 22]])
    478 bytes (59 words) - 02:34, 6 January 2016
  • ...arcwise connected]]? (E.D. Tymchatyn, 26 September 1974, [[Houston Problem Book Problem 66]])
    456 bytes (56 words) - 02:35, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 33|Problem 33]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Let a [[hereditarily unicoherent]] [[continuum]] $X$ have
    793 bytes (103 words) - 02:42, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 34|Problem 34]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> What mappings among [[hereditarily unicoherent]] [[contin
    739 bytes (89 words) - 04:20, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 35|Problem 35]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Let each nonconstant [[open mapping]] on an [[arcwise con
    587 bytes (80 words) - 04:21, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 36|Problem 36]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> All [[dendrite|dendrites]] which are [[homeomorphism|home
    669 bytes (88 words) - 04:23, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 37|Problem 37]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Does every [[chain]] of [[dendrite|dendrites]] with respe
    652 bytes (85 words) - 04:25, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 38|Problem 38]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Does there exist a sequence $\{X_n \colon n \in \mathbb{N
    571 bytes (78 words) - 04:27, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 39|Problem 39]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Does there exist a [[nondegenerate]] [[arcwise connected]
    477 bytes (57 words) - 04:28, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 40|Problem 40]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Is the [[locally monotone]] image of a [[WAO dendroid|$WA
    455 bytes (55 words) - 04:30, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 41|Problem 41]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Does every [[bounded]] [[chain]] of [[dendrite|dendrites]
    612 bytes (81 words) - 04:32, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 42|Problem 42]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Does every [[bounded]] [[chain]] of [[dendrite|dendrites]
    600 bytes (78 words) - 04:33, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 43|Problem 43]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> One infinite decreasing sequence of [[dendrite|dendrites]
    516 bytes (70 words) - 04:35, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 44|Problem 44]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Find an infintie decreasing sequence of ([[smooth]]) [[fa
    354 bytes (42 words) - 04:35, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 45|Problem 45]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> When each nonconstant [[open map|open]] [[strongly monoto
    476 bytes (60 words) - 04:38, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 46|Problem 46]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Does the [[uniform continuum-chainability]] of a [[contin
    620 bytes (74 words) - 04:39, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 47|Problem 47]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Identify the [[semilattice|semilattices]] that are [[isom
    553 bytes (69 words) - 04:41, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 48|Problem 48]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Is there a [[scattered]] [[Valdivia]] [[compact]] space w
    386 bytes (46 words) - 04:42, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 49|Problem 49]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Has each [[openly minimal]] [[dendrite]] at most $2$ [[no
    538 bytes (68 words) - 04:43, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 50|Problem 50]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Find all [[monotone-homogeneous]] [[dendrite|dendrites]].
    357 bytes (39 words) - 04:44, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 51|Problem 51]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Does there exist an infinite sequence of [[dendrite|dendr
    422 bytes (50 words) - 04:45, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 52|Problem 52]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Let $X$ be a [[continuum]], [[dimension|$\mathrm{dim}(X)$
    470 bytes (60 words) - 04:46, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 53|Problem 53]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Does there exist a [[model]] for all [[planar]] [[arcwise
    393 bytes (46 words) - 04:47, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 54|Problem 54]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Find a "good" characterization of being an [[arc-like]] [
    370 bytes (43 words) - 04:48, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 55|Problem 55]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Let $X$ be a [[chainable]] [[continuum]] with a [[mean]].
    381 bytes (48 words) - 04:49, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 56|Problem 56]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Let $X$ be a [[dendroid]] with the [[property of Kelley]]
    394 bytes (51 words) - 04:49, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 57|Problem 57]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Does there exist a [[homogeneous]] [[continuum]] with the
    417 bytes (49 words) - 04:50, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 58|Problem 58]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Find a topological characterization of the [[Sierpinski t
    367 bytes (42 words) - 04:51, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 59|Problem 59]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Let $M$ be a [[continuum]] such that if $\mathcal{G}$ is
    647 bytes (82 words) - 04:53, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 60|Problem 60]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Let $X$ be a [[continuum]]. Let $F_n(X)=\{A \subset X, A
    505 bytes (71 words) - 04:54, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 61|Problem 61]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Let $X$ be a [[continuum]]. Must $X$ be [[homeomorphism|h
    416 bytes (51 words) - 04:55, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 62|Problem 62]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Find all [[locally connected]] [[continuum|continua]] $X$
    448 bytes (55 words) - 04:56, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 63|Problem 63]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> For a continuum $X$ and a subset $A \subset X$ denote $T(
    623 bytes (95 words) - 04:58, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 64|Problem 64]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Find all [[dendrite|dendrites]] which are [[homeomorphism
    414 bytes (48 words) - 04:58, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 65|Problem 65]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Is the [[planability]] of [[fan|fants]] preserved by [[op
    343 bytes (42 words) - 04:59, 6 January 2016
  • ...em 3]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 72]]
    293 bytes (34 words) - 05:01, 6 January 2016
  • ...em 4]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 72]]
    293 bytes (34 words) - 05:01, 6 January 2016
  • ...em 5]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 77]]
    293 bytes (34 words) - 05:02, 6 January 2016
  • ...em 6]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 79]]
    293 bytes (34 words) - 05:02, 6 January 2016
  • ...em 7]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 84]]
    293 bytes (34 words) - 05:02, 6 January 2016
  • ...em 8]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 90]]
    293 bytes (34 words) - 05:03, 6 January 2016
  • ...em 9]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 96]]
    293 bytes (34 words) - 05:03, 6 January 2016
  • ...m 10]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 97]]
    295 bytes (34 words) - 05:04, 6 January 2016
  • ...m 11]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 101]]
    296 bytes (34 words) - 05:04, 6 January 2016
  • ...m 12]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 104]]
    296 bytes (34 words) - 05:05, 6 January 2016
  • ...m 13]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 106]]
    296 bytes (34 words) - 05:05, 6 January 2016
  • ...m 14]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 107]]
    296 bytes (34 words) - 05:06, 6 January 2016
  • ...m 15]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 113]]
    296 bytes (34 words) - 05:06, 6 January 2016
  • ...m 16]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 119]]
    296 bytes (34 words) - 05:07, 6 January 2016
  • ...m 17]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 123]]
    296 bytes (34 words) - 05:07, 6 January 2016
  • ...m 18]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 131]]
    296 bytes (34 words) - 05:07, 6 January 2016
  • ...m 19]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 135]]
    296 bytes (34 words) - 05:08, 6 January 2016
  • ...m 20]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 137]]
    296 bytes (34 words) - 05:08, 6 January 2016
  • ...m 21]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 150]]
    296 bytes (34 words) - 05:09, 6 January 2016
  • ...m 22]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 151]]
    296 bytes (34 words) - 05:09, 6 January 2016
  • ...m 23]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 155]]
    296 bytes (34 words) - 05:10, 6 January 2016
  • ...m 24]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 156]]
    296 bytes (34 words) - 05:10, 6 January 2016
  • ...m 25]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 168]]
    296 bytes (34 words) - 05:10, 6 January 2016
  • ...m 26]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 171]]
    296 bytes (34 words) - 05:11, 6 January 2016
  • ...m 27]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 172]]
    296 bytes (34 words) - 05:11, 6 January 2016
  • ...m 28]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 174]]
    296 bytes (34 words) - 05:11, 6 January 2016
  • ...m 29]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 179]]
    296 bytes (34 words) - 05:12, 6 January 2016
  • ...m 30]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 181]]
    296 bytes (34 words) - 05:12, 6 January 2016
  • ...m 31]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> See [[Houston Problem Book Problem 215]]
    296 bytes (34 words) - 05:13, 6 January 2016
  • ...>[[Pavel Pyrih Problem Book Problem 32|Problem 32]] ([[Pavel Pyrih Problem Book|PPPB]]):</strong> Does there exist a [[weakly Suslinean]], [[locally connec
    496 bytes (61 words) - 05:14, 6 January 2016
  • {{Book|Continuum Theory, an Introduction|1992|Chapman & Hall||Sam B. Nadler, Jr.}} [[Category:Book]]
    219 bytes (23 words) - 03:20, 24 December 2018

View (previous 500 | next 500) (20 | 50 | 100 | 250 | 500)