Timeline for The middle eigenvalues of an undirected graph
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 1, 2022 at 15:45 | history | edited | Martin Sleziak | CC BY-SA 4.0 |
http -> https (the question was bumped anyway)
|
| Mar 12, 2010 at 17:30 | comment | added | Michael Lugo | Noah, that's not a bad idea, although I'm not sure if the "hexagonal tiling" region ever gets that large in practice. | |
| Mar 6, 2010 at 17:35 | comment | added | Noah Snyder | One interesting possibility would be to consider the case where the "hexagonal tiling" region is large relative to the rest of the stuff. Then somehow figure out the rough distribution of the eigenvalues for large hexagonal graphs, and then apply interlacing. | |
| Mar 6, 2010 at 13:06 | history | answered | Michael Lugo | CC BY-SA 2.5 |