Open Access Authoring @ Caltech

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.

Saturday, December 24, 2005

Peter Keevash (2005) The Turán problem for hypergraphs of fixed size. Electronic Journal of Combinatorics, 12(1):N11. CaltechAUTHORS

posted by George Porter at 12:13 AM

0 Comments:

Post a Comment

<< Home

Contributors

  • Arun Sannuti
  • Lindsay Cleary
  • Ming Ni
  • George Porter
  • Unknown
  • Dana Roth

Previous Posts

  • Changhuei Yang (2005) Molecular Contrast Optical C...
  • David Merritt and Miloš Milosavljević (2005) Massi...
  • Massimo Tinto and Sanjeev V. Dhurandhar (2005) Tim...
  • Brett Maune, Jeremy Witzens, Thomas Baehr-Jones, M...
  • Terrell D. Neal, Koichi Okamoto, and Axel Scherer....
  • X M H Huang, X L Feng, C A Zorman, M Mehregany and...
  • John Doyle and Marie Csete. (2005) Motifs, Control...
  • Paul W. Sternberg, Thomas Hunt Morgan Professor of...
  • Jehoshua (Shuki) Bruck, Gordon and Betty Moore Pro...
  • Matthew O. Jackson, Edie and Lew Wasserman Profess...

Atom Feed  Subscribe