Peter Keevash on bounding permutation graphs
Peter Keevash, Po-Shen Loh and Benny Sudakov (2006) Bounding the Number of Edges in Permutation Graphs. Electronic Journal of Combinatorics, 13(1):R44. CaltechAUTHORS
Individual researchers disseminate their findings in different ways - many of them freely available on the web. This blog is a running list of research papers, editorial appointments, and other news about open access scholarship by Caltech researchers.
0 Comments:
Post a Comment
<< Home