Sciweavers

73 search results - page 6 / 15
» A Permutation Regularity Lemma
Sort
View
JCT
2011
101views more  JCT 2011»
13 years 1 months ago
Almost all triple systems with independent neighborhoods are semi-bipartite
The neighborhood of a pair of vertices u, v in a triple system is the set of vertices w such that uvw is an edge. A triple system H is semi-bipartite if its vertex set contains a ...
József Balogh, Dhruv Mubayi
RSA
2011
126views more  RSA 2011»
13 years 1 months ago
Local resilience of almost spanning trees in random graphs
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...
József Balogh, Béla Csaba, Wojciech ...
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
13 years 6 months ago
Pattern Avoidance in Permutations: Linear and Cyclic Orders
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
Antoine Vella
JCT
2011
141views more  JCT 2011»
13 years 1 months ago
Bijections for Baxter families and related objects
The Baxter number Bn can be written as Bn = n k=0 Θk,n−k−1 with Θk,ℓ = 2 (k + 1)2 (k + 2) k + ℓ k k + ℓ + 1 k k + ℓ + 2 k . These numbers have first appeared in the...
Stefan Felsner, Éric Fusy, Marc Noy, David ...
TABLEAUX
2005
Springer
14 years 5 days ago
A Tableau Calculus with Automaton-Labelled Formulae for Regular Grammar Logics
We present a sound and complete tableau calculus for the class of regular grammar logics. Our tableau rules use a special feature called automaton-labelled formulae, which are simi...
Rajeev Goré, Linh Anh Nguyen