User talk:Koko90

OhanaUnitedTalk page 15:50, 8 June 2009 (UTC)

Titan Globe
Kaldari has proposed a replacement image. Please consider updating your !vote.  wadester 16  04:53, 15 June 2009 (UTC)

Another nice graph
Since you've been adding articles on so many nice graphs lately: there's a 24-vertex cubic symmetric graph (the generalized Desargues graph GD(12,5)) that I think also deserves mentioning. In the absence of any better name, I called it the "Nauru graph" in the first of these five blog posts about it, which also includes some sources. I'd be happy to upload any of the images from those posts to Wikimedia commons so they can be used in an article, but given my prior involvement I wouldn't want to write an article here myself. —David Eppstein (talk) 15:54, 19 August 2009 (UTC)
 * Hello David. Since my PHD I am a very interested in cubic symmetric graph. That would be a pleasure writing the article if you upload the files. So you are 11011110 (0xDE) ? If I make a citation of your blog can I wrote David Eppstein as author name ?
 * PS : Is there any higher-order LCF notation for the Nauru graph ? I want to draw it showing a nice Hamiltonian cycle. Koko90 (talk) 16:07, 19 August 2009 (UTC)
 * The LCF notation is also in the first post of that series: [5,-9,7,-7,9,-5]4. Yes, I'm 0xDE (those are my initials), so you can write and link my author name as David Eppstein. —David Eppstein (talk) 16:22, 19 August 2009 (UTC)
 * I have created a basic article about the Nauru graph. Can you proofread it ? You are now free to add some more info and upload your pics. Koko90 (talk) 08:54, 20 August 2009 (UTC)

Thanks for all the graph theory input, by the way. Radagast3 (talk) 08:20, 21 August 2009 (UTC)


 * Another couple of redlinks I left in the symmetric graph article: half-transitive graph and Holt's graph. Unfortunately I don't seem to have online access to the Holt article. There's a textual description of his graph in this article which also proves that it's the smallest half-transitive but non-symmetric graph. —David Eppstein (talk) 03:46, 4 September 2009 (UTC)

DYK nomination
Hi. I've nominated Tutte 12-cage, an article you worked on, for consideration to appear on the Main Page as part of Did you know. You can see the hook for the article here, where you can improve it if you see fit. Bruce1eetalk 15:15, 21 September 2009 (UTC)

DYK for Tutte 12-cage

 * You may be interested to know that Tutte 12-cage attracted 5,800 hits while on the Main Page. See DYKSTATS. --Bruce1eetalk 05:43, 23 September 2009 (UTC)

Horton graph aut group
I assumed, wrongly, that the Horton graph is isomorphic to the regular map which tiles the torus with 48 hexagons. That regular map is fully transitive, so it must have four times as many automorphisms as edges, i.e. 576. The regular map, like the Horton graph, has 96 vertices, 144 edges, chromatic number 2,chromatic index 3; but its radius is 8, so it's not the same as the Horton graph. Maproom (talk) 12:46, 23 October 2009 (UTC)

Barnstar

 * Thank you. Koko90 (talk) 09:29, 11 April 2010 (UTC)

Graph drawings and copyright issues
I received a complaint today from Ed Pegg that many of the images in Commons:User:Koko90 (and in the Wikipedia articles that use them) are copied from MathWorld. I agree: the images are far more similar than could be accounted for by coincidence, both in their layout and in their visual style. We shouldn't be doing this: all content in Wikipedia needs to be freely licensed, MathWorld is subject to a non-free copyright, and redrawing an image to look identical to an existing one doesn't break it out of copyright. Additionally, it is inappropriate to claim credit for drawing these images when the work of finding a good layout for them comes from someone else. Would you be willing to look through these, check which ones have this problem, and either produce more original drawings of the same graphs or take down the infringing drawings? —David Eppstein (talk) 20:23, 24 June 2010 (UTC)
 * For the style, it is easy to change (SVG is very flexible).
 * For the layouts, I have two sources : LCF notations (for Hamiltonian graphs) and Mathworld or literature. When I chose a Mathworld layout (or any other already published layout), I redraw the graph with Inkscape. When I uses LCF notations I generate the graph with graphviz and a custom code.
 * There is a problem: the layouts on Mathworld are, in most of the cases, the layouts used in classic literature. For some well known graphs, you find on Mathworld ALL the "classics" layouts. Example: it is impossible to draw the Coxeter graph without using a layout already used by Mathworld (or a very similar layout).
 * I can wrote a list of graphs with the origin of the layout for a deletion request. But I need to know how different a layout must be for avoiding copyright issues ? How about and layout 5 on  ?
 * A good example is and . Up to the style, your layout is exactly the one used on Mathworld. And the original drawing by Coxeter is still copyrighted (Coxeter died in 2003).
 * Koko90 (talk) 10:13, 25 June 2010 (UTC)

LCF notation
There is a criticism at Talk:LCF notation which you may wish to respond to. The criticism seems wrong to me. -- Radagast 3 (talk) 20:50, 22 September 2010 (UTC)
 * He is right, but the current article is not wrong. Koko90 (talk)

Speedy deletion nomination of Scott Glosserman


A tag has been placed on Scott Glosserman requesting that it be speedily deleted from Wikipedia. This has been done under section A7 of the criteria for speedy deletion, because the article appears to be about a person or group of people, but it does not indicate how or why the subject is important or significant: that is, why an article about that subject should be included in an encyclopedia. Under the criteria for speedy deletion, such articles may be deleted at any time. Please see the guidelines for what is generally accepted as notable.

If you think that this notice was placed here in error, you may contest the deletion by adding to the top of the page that has been nominated for deletion (just below the existing speedy deletion, or "db", tag; if no such tag exists, then the page is no longer a speedy delete candidate and adding a hang-on tag is unnecessary), coupled with adding a note on the talk page explaining your position, but be aware that once tagged for speedy deletion, if the page meets the criterion, it may be deleted without delay. Please do not remove the speedy deletion tag yourself, but don't hesitate to add information to the page that would render it more in conformance with Wikipedia's policies and guidelines. If the page is deleted, you can contact one of these administrators to request that the administrator userfy the page or email a copy to you. Cindamuse (talk) 11:59, 2 November 2010 (UTC)

Nomination of Scott Glosserman for deletion
A discussion has begun about whether the article Scott Glosserman, which you created or to which you contributed, should be deleted. While contributions are welcome, an article may be deleted if it is inconsistent with Wikipedia policies and guidelines for inclusion, explained in the deletion policy.

The article will be discussed at Articles for deletion/Scott Glosserman until a consensus is reached, and you are welcome to contribute to the discussion.

You may edit the article during the discussion, including to address concerns raised in the discussion. However, do not remove the article-for-deletion template from the top of the article. Cindamuse (talk) 14:41, 2 November 2010 (UTC)

Voeux de Jean-François Monteil pour 2012
(84.101.36.81 (talk) 22:49, 29 January 2012 (UTC)) Sur le conseil d'Epsilon0, j'ai surtout agi dans le cadre du système des knols auquel Google met fin le premier Mai prochain. Tous mes knols vont donc être transférés sur deux de mes sites. Si vous désirez tout savoir de mes activités récentes, tapez: Knol 000. Encore une fois bonne année. Jean-François Monteil
 * Merci et bonne année 2012 ! Je regrette vivement la fermeture de Knol. Koko90 (talk) 09:19, 30 January 2012 (UTC)

ArbCom elections are now open!
MediaWiki message delivery (talk) 16:18, 23 November 2015 (UTC)