Mario Stefanutti

less info
145 reputation
5
bio website 4coloring.wordpress.com
location Rome
age 45
visits member for 3 years
seen Feb 23 at 0:48

Feb
8
comment Question about 3-regular graphs with a restriction (also fullerene and four color theorem)
Thanks again. Plantri is really a great program and it is so fast. Where my program takes 1 minute to elaborate all graphs of 15 faces, Plantri is istantaneous.
Jan
29
comment Question about 3-regular graphs with a restriction (also fullerene and four color theorem)
Thanks. So fast! I'm going to try this program right away.
Jan
29
accepted Question about 3-regular graphs with a restriction (also fullerene and four color theorem)
Jan
29
asked Question about 3-regular graphs with a restriction (also fullerene and four color theorem)
Mar
18
accepted Is there a formula to count how many different topological regular maps can be created with n faces (on a sphere)?
Jun
28
comment How many “different” colorings (excluding exchanges) exist for a given map (graph)?
Hi, how did you make these computations? I was planning to implement this feature into the program I'm building, but I'm having trouble to eliminate maps that "seems" different but that are actually the same map (Homeomorphic maps). See this other post: mathoverflow.net/questions/62328/…
Jun
8
revised Representations of regular maps (four color theorem)
edited tags
May
20
revised Representations of regular maps (four color theorem)
added 29 characters in body
May
19
revised Representations of regular maps (four color theorem)
added 225 characters in body
May
6
comment Representations of regular maps (four color theorem)
I really like this one based on the circle packing theorem, thanks!
May
4
awarded  Commentator
May
4
comment Representations of regular maps (four color theorem)
Hi Paul, I remember a comment made about this question by Noah Snyder. mathoverflow.net/questions/19240/…. "As far as I know there isn't anyone who is holed up in their attic thinking about only the 4-color theorem, instead there's a lot of people who every time they find a new tool think: hrm, I wonder if this tool would work on the 4-color theorem?" For example check the current reserch of Robin Thomas (people.math.gatech.edu/~thomas)
May
3
asked Representations of regular maps (four color theorem)
Apr
29
revised Is there a formula to count how many different topological regular maps can be created with n faces (on a sphere)?
added 228 characters in body
Apr
29
revised Is there a formula to count how many different topological regular maps can be created with n faces (on a sphere)?
added 239 characters in body
Apr
27
awarded  Supporter
Apr
27
comment Is there a formula to count how many different topological regular maps can be created with n faces (on a sphere)?
I think I located one of the pair you were talking about: 1.1.8 and 1.3.4. You are right, these are the same map! I have to review the manual computation of the count of different maps. I still would like to find a formula to count different maps, avoiding to manually calculate them ... also because this is error prone! Thanks!
Apr
27
comment Is there a formula to count how many different topological regular maps can be created with n faces (on a sphere)?
Hi jc, I added some numerical IDs to the maps. I wasn't able to pinpoint the pairs you were talking about. Can you specify them using the IDs? I just want to be sure we talk about the same pairs of maps.
Apr
27
revised Is there a formula to count how many different topological regular maps can be created with n faces (on a sphere)?
added 41 characters in body
Apr
27
comment Is there a formula to count how many different topological regular maps can be created with n faces (on a sphere)?
Actually it matches this one: oeis.org/A163138 (0 does not have to be considered because the map in that case is not regular). But I think 4 terms are just too few and it may be just a coincidence.