title: Combinatorial Algorithms: Generation, Enumeration, and Search (Discrete Mathematics and Its Applications)
author:  Donald L. Kreher 
description: "Very clear exposition. I jumped right into [the] heuristic methods chapter and understood it almost instantly..." - Dean H. Judson, Ph.D., Nevada State Demographer "book serves as an introduction to the basic problems and methodsstyle is clear, transparentThe algorithmic problems are always considered and they are in the center of the discussionhas a fresh approach to combinatorics that is available for readers, students in computer science, electrical engineering without any background in mathematics." - Piter Hajnal, Acta Science Math
zlib_text: 
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  ![](index-1_1.jpg)
  
  
  Combinatorics
  
  
  Second Edition
  
  
  WILEY-INTERSCIENCE
  
  
  SERIES IN DISCRETE MATHEMATICS AND OPTIMIZATION
  
  
  ADVISORY EDITORS
  
  
  RONALD L. GRAHM
  
  
  University of California at San Diego, U.S.A.
  
  
  JAN KAREL LENSTRA
  
  
  Department of Mathematics and Computer Science,
  
  
  Eindhoven University of Technology, Eindhoven, The Netherlands JOEL H. SPENCER
  
  
  Courant Institute, New York, New York, U.S.A.
  
  
  A complete list of titles in this series appears at the end of this volume.
  
  
  ![](index-4_1.png)
  
  
  Combinatorics
  
  
  SECOND EDITION
  
  
  RUSSELL MERRIS
  
  
  California State University, Hayward
  
  
  A JOHN WILEY & SONS, INC., PUBLICATION
  
  
  This book is printed on acid-free paper. 1
  
  
  
  
  
  Copyright # 2003 by John Wiley & Sons, Inc., Hoboken, New Jersey. All rights
  reserved.
  
  
  Published simultaneously in Canada.
  
  
  No part of this publication may be reproduced, stored in a retrieval system or
  transmitted in any form or by any means, electronic, mechanical, photocopying,
  recording, 