22 citations · 112 across the 37 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.CO2012
A probabilistic approach to consecutive pattern avoiding in permutations
Guillem Perarnau
We present a new approach to the problem of enumerating permutations of length n that avoid a fixed consecutive pattern of length m. We use this idea to give explicit upper and low…
math.CO2012
Matchings in Random Biregular Bipartite Graphs
Guillem Perarnau, Giorgis Petridis
We study the existence of perfect matchings in suitably chosen induced subgraphs of random biregular bipartite graphs. We prove a result similar to a classical theorem of Erdos and…