Back to W. J. Charatonik's homepage
Wlodzimierz J. Charatonik
Erdös number
The Erdös number is defined
inductively as follows:
The Erdös number of Paul Erdös
is zero.
The Erdös number of X is less then or equal
to n+1 if there is Y whose Erdös number less then or equal to n and X
and Y have published a common paper.
For a list of people with Erdös number one or two
click here
You may also find many ineresting Facts
about Erdös Numbers and the Collaboration Graph
My Erdös number is less than or equal to 5 and the
proof (by P. Pyrih) is presented below.
The path is:
W. J. Charatonik -> J. J. Charatonik -> A. Bella -> A. W. Hager ->
M. Henriksen -> P. Erdös
It has been checked by a search engine by Jerry Grossman that in fact it is equal
to 5.
- J. J. Charatonik, W. J. Charatonik, K. Omiljanowski and J. R. Prajs, Hyperspace retractions for curves, Dissertationes Math. (Rozprawy Mat.), 370 (1997) 1-34.
- A. Bella, J. J. Charatonik, and K. Omiljanowski, Connectivity properties and a change of the topology, Glas. Mat. Ser. III 25(45) (1990), no. 1, 173--193.
- A. Bella, A. W. Hager, J. Martinez, S. Woodward and H. Zhou, Specker spaces and their absolutes, Topology Appl. 72 (1996), no. 3, 259--271.
- F. Dashiell, A. Hager, M. Henriksen, Order-Cauchy completions of rings and vector lattices of continuous functions, Canad. J. Math. 32 (1980), no. 3, 657--685.
- P. Erdös , L. Gillman, M. Henriksen, An isomorphism theorem for real-closed
fields, Ann. of Math. (2) 61, (1955). 542--554.
Another proof, with a totally different path (having common
end points only with the previous one), was found using the list.
It was suggested by Martin Bohner. I like it better, because I know
almost all (i.e. all but finitely many) people on that list.
The path is:
W. J. Charatonik -> A. Illanes -> I. Puga -> V. Neumann-Lara -> L. Lov‡sz
-> P. Erdös
- J. J. Charatonik, W. J. Charatonik and A. Illanes, Openness of induced mappings, Topology Appl. 98 (1999), 67-80.
- A. Illanes and I. Puga, Determining finite graphs by their large Whitney levels, Topology Appl. 60 (1994), 173-184.
- V. Neumann-Lara and I. Puga-Espinosa, Shore points and dendrites. Proc. Amer. Math. Soc. 118 (1993), 939-942.
- L. Lovász, V. Neumann Lara and M. Plummer, Mengerian theorems for paths of bounded length, Period. Math. Hungar. 9 (1978), 269-276.
- P. Erdös L. Lovász and K. Vesztergombi, On the graph of large distances, Discrete Comput. Geom. 4 (1989), 541-549.
The Erdös
number of the second kind is inductively defined as follows:
The Erdös number of the second kind of Paul Erdös is zero.
The Erdös number of the second kind of X is
less then or equal to n+1 if there is Y whose
Erdös number of the second kind less then or equal to
n and X and Y have published a common paper as
the only two authors.
My Erdös number of the second kind was checked using
a search engine by Jerry Grossman, and it was found to be 6.
The path is:
W. J. Charatonik -> J. J. Charatonik -> C. Eberhart
-> S. B. Nadler, Jr. -> K. Ciesielski -> F.
Galvin
and the details are presented below. Again I have the privilage
to know everyone on the list but the coauthor of Erdös.
- J. J. Charatonik and W. J. Charatonik, Limit properties of induced mappings, Topology Appl. 100 (2000), no. 2-3, 103-118.
- J. J. Charatonik and C. A. Eberhart, On contractible dendroids, Colloq. Math. 25 (1972), 89-98, 164.
- C. Eberhart and S. B. Nadler, Jr., Irreducible Whitney levels, Houston J. Math. 6 (1980), no. 3, 355-363.
- K. Ciesielski and S. B. Nadler, Jr., An absorption property for the composition of functions, Real Anal. Exchange 18 (1992/93), no. 2, 420-426.
- K. Ciesielski and F. Galvin, Cylinder problem, Fund. Math. 127 (1987), no. 3, 171-176.
- P. Erdös and F. Galvin, Monochromatic infinite paths, Discrete Math. 113 (1993), no. 1-3, 59-70.
Back to W. J. Charatonik's homepage