Timeline for What is the cardinality of the family of unlabelled bipartite graphs on n vertices?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 13, 2018 at 17:52 | answer | added | AYO | timeline score: 1 | |
| Feb 7, 2013 at 9:08 | vote | accept | Andrew | ||
| Feb 5, 2013 at 23:31 | answer | added | Samuel Vidal | timeline score: 1 | |
| Feb 4, 2013 at 3:40 | answer | added | Ira Gessel | timeline score: 3 | |
| Feb 4, 2013 at 2:55 | comment | added | Max Alekseyev | It look to me that the given counting for labeled bipartite graphs is incorrect. Labeling of vertices does not imply particular partition of the vertices into V_1 and V_2. E.g., an isolated vertex may be viewed as belonging to V_1 or V_2 but that does not change the graph. | |
| Feb 3, 2013 at 17:39 | comment | added | Carl Feynman | In the limit for large $n$, the average graph has no automorphisms, so the number of unlabeled graphs is simply the number of labeled graphs divided by the number of possible labelings, i.e. $n!$. | |
| Feb 3, 2013 at 17:06 | answer | added | Samuel Vidal | timeline score: 0 | |
| Feb 3, 2013 at 15:47 | comment | added | Steve Huntsman | oeis.org/A005142 | |
| Feb 3, 2013 at 15:46 | comment | added | Steve Huntsman | oeis.org/A033995 | |
| Feb 3, 2013 at 15:20 | history | asked | Andrew | CC BY-SA 3.0 |