Timeline for Almost all graphs have a subgraph from a large class of graphs with constant order
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 5, 2012 at 15:09 | comment | added | Jernej | Hehe, let me write a bit about the motivation behind my question :-) I am currently studying cospectrality results, more precisely, I'd like to see if there is anything to be deduced from the proof of tree cospectrality in relation with bipartite cospectrality. In the book "Topics in Algebraic Graph Theory" there's a sketch of the proof of Schenwk, but some critical part of it is missing. Since I am not able to get access to the cited paper, I tried to came up with my own proof and got stuck in the part posted here :-) | |
| Apr 5, 2012 at 13:41 | history | answered | Brendan McKay | CC BY-SA 3.0 |