When no single universal model for a set of structures exists at a given cardinal, then one may ask in which models of set theory does there exist a small family which embeds the r...
The best approximation algorithm for Max Cut in graphs of maximum degree 3 uses semidefinite programming, has approximation ratio 0.9326, and its running time is (n3.5 log n) ; bu...
The cocircuit graph of an oriented matroid is the 1-skeleton of the cellular decomposition induced by the Topological Representation Theorem due to Folkman and Lawrence (1978) [J....
We develop a theory of representations in Rm for directed strongly regular graphs, which gives a new proof of a nonexistence condition of Jørgensen [8]. We also describe some new...
Chris D. Godsil, Sylvia A. Hobart, William J. Mart...
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. ...