Skip to Main Content
Combinatorics of Permutations, 2nd Edition
book

Combinatorics of Permutations, 2nd Edition

by Miklos Bona
April 2016
Intermediate to advanced content levelIntermediate to advanced
478 pages
14h 44m
English
Chapman and Hall/CRC
Content preview from Combinatorics of Permutations, 2nd Edition
In Any Way but This. Pattern Avoidance. The Basics. 177
4.5 The Proof of the Stanley-Wilf Conjecture
The goal of this section is to present a proof of the Stanley–Wilf conjecture.
In order to achieve this goal, we will discuss one more conjecture involving
0-1 matrices, show why it implies the Stanley–Wilf conjecture, and then prove
the conjecture on the 0-1 matrices. The proof we present was announced by
Adam Marcus and abor Tardos in the Fall of 2003. Before that, Noga Alon
and Ehud Friedgut [9] proved a somewhat weaker result.
4.5.1 The uredi–Hajnal Conjecture
Let us extend the notion of pattern avoidance to 0-1 matrices as follows.
DEFINITION ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Introduction to Combinatorics, 2nd Edition

Introduction to Combinatorics, 2nd Edition

Martin J. Erickson

Publisher Resources

ISBN: 9781439850527