* '''[[Adjacency matrix]]''' - there is an N by N matrix, where N is the number of vertices in the graph. If there is an edge from some vertex x to some ve
* The [[Erdős-Faber-Lovász conjecture]] (unsolved)
17 KB (2,473 words) - 11:44, 6 September 2007
..., and its results. Although the questions are diverse and never-ending, a number of recurrent themes can be recognized:
...unit square was incommensurable with its (unit-length) edge: There was no number that represented how much longer the diagonal was than an edge. This caused
105 KB (15,873 words) - 11:53, 20 August 2007
..., and its results. Although the questions are diverse and never-ending, a number of recurrent themes can be recognized:
...unit square was incommensurable with its (unit-length) edge: There was no number that represented how much longer the diagonal was than an edge. This caused
105 KB (15,875 words) - 22:02, 25 January 2008