Partitioning Rn into Connected Components

被引：0

作者：

Horak, Peter ^{[1
]}

机构：

[1] Univ Washington, Sch Interdisciplinary Arts & Sci, Tacoma, WA 98402 USA

来源：

AMERICAN MATHEMATICAL MONTHLY | 2015年 / 122卷 / 03期

关键词：

D O I：

10.4169/amer.math.monthly.122.03.280

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Intuition is one of the crucial parts in mathematical research. However, it might turn out to be a deceiving part. Statements that seem to be obvious are very hard to prove or they are even not valid. In this note we describe an example that has both features. Although it is "obvious," its proof in R-2 is based on a deep result and it is not true in R-3.

引用

页码：280 / 283

页数：4

共 50 条

[1] Max-min partitioning of grid graphs into connected components
Becker, R
Lari, I
Lucertini, M
Simeone, B
NETWORKS, 1998, 32 (02) : 115 - 125
[2] Fine partitioning of 2-connected components using Fiedler vector
Dvorsky, Jiri
Snasel, Vaclav
SOCINFO 2009: INTERNATIONAL WORKSHOP ON SOCIAL INFORMATICS, PROCEEDINGS, 2009, : 52 - 56
[3] PARTITIONING THE LATTICE POINTS IN RN
PAUL, JL
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1979, 26 (03) : 238 - 248
[4] Partitioning Graphs into Connected Parts
van't Hof, Pim
Paulusma, Daniel
Woeginger, Gerhard J.
COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2009, 5675 : 143 - +
[5] Partitioning graphs into connected parts
van't Hof, Pim
Paulusma, Daniel
Woeginger, Gerhard J.
THEORETICAL COMPUTER SCIENCE, 2009, 410 (47-49) : 4834 - 4843
[6] CONNECTED COMPONENTS AND ITERATED QUASI CONNECTED COMPONENTS IN POLISH SPACES
RAISONNIER, J
COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1981, 292 (02): : 167 - 169
[7] Weighted Ergodic Components in Rn
Kostic, Marko
Chaouchi, Belkacem
Du, Wei-Shih
BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 2022, 48 (05) : 2221 - 2253
[8] ON PARTITIONING THE EDGES OF GRAPHS INTO CONNECTED SUBGRAPHS
JUNGER, M
REINELT, G
PULLEYBLANK, WR
JOURNAL OF GRAPH THEORY, 1985, 9 (04) : 539 - 549
[9] Partitioning a Graph into Highly Connected Subgraphs
Borozan, Valentin
Ferrara, Michael
Fujita, Shinya
Furuya, Michitaka
Manoussakis, Yannis
Narayanan, N.
Stolee, Derrick
JOURNAL OF GRAPH THEORY, 2016, 82 (03) : 322 - 333
[10] On partitioning a graph into two connected subgraphs
Paulusma, Daniel
van Rooij, Johan M. M.
THEORETICAL COMPUTER SCIENCE, 2011, 412 (48) : 6761 - 6769

← 1 2 3 4 5 →