Nearly Complete Graphs Decomposable into Large Induced Matchings and Their Applications. Alon, N., Moitra, A., & Sudakov, B In Journal of the European Mathematical Society, 2013. Previous version in STOC 2012
bibtex   
@INPROCEEDINGS{AMS12,
  AUTHOR = {N. Alon and A. Moitra and B Sudakov},
  TITLE = {Nearly Complete Graphs Decomposable into Large Induced Matchings and Their Applications},
  BOOKTITLE = {Journal of the European Mathematical Society},
  YEAR = {2013},
  note = {Previous version in STOC 2012}
}

Downloads: 0