Global Methods for Combinatorial Isoperimetric Problems

Cambridge, New York, Melbourne, Madrid, Cape Town, Singapore, S o Paulo
Cambridge University Press
The Edinburgh Building, Cambridge CB2 2RU, UK
Published in the United States of America by Cambridge University Press, New York
www.cambridge.org
Information on this title: www.cambridge.org/9780521832687
2004 Cambridge University Press
This publication is in copyright. Subject to statutory exception and to the provision of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University Press.
ISBN-13 978-0-511-18974-6 eBook (Adobe Reader)
ISBN-10 0-511-18974-5 eBook (Adobe Reader)
ISBN-10 0-521-83268-3 hardback
Cambridge University Press has no responsibility for the persistence or accuracy of URLs for external or third-party internet websites referred to in this publication, and does not guarantee that any content on such websites is, or will remain, accurate or appropriate.
Dedication
Dedicated to the memory of Edward C. Posner, friend and mentor
Global Methods for Combinatorial Isoperimetric Problems
Certain constrained combinatorial optimization problems have a natural analogue in the continuous setting of the classical isoperimetric problem.The study of so-called combinatorial isoperimetric problems exploits similarities between these two, seemingly disparate, settings. This text focuses on global methods. This means that morphisms, typically arising from symmetry or direct product decomposition, are employed to transform new problems into more restricted and easily solvable settings whilst preserving essential structure.
This book is based on Professor Harper s many years experience in teaching this subject and is ideal for graduate students entering the field.