1,368 research outputs found
Hereditary properties of partitions, ordered graphs and ordered hypergraphs
In this paper we use the Klazar-Marcus-Tardos method to prove that if a
hereditary property of partitions P has super-exponential speed, then for every
k-permutation pi, P contains the partition of [2k] with parts {i, pi(i) + k},
where 1 <= i <= k. We also prove a similar jump, from exponential to factorial,
in the possible speeds of monotone properties of ordered graphs, and of
hereditary properties of ordered graphs not containing large complete, or
complete bipartite ordered graphs.
Our results generalize the Stanley-Wilf Conjecture on the number of
n-permutations avoiding a fixed permutation, which was recently proved by the
combined results of Klazar and of Marcus and Tardos. Our main results follow
from a generalization to ordered hypergraphs of the theorem of Marcus and
Tardos.Comment: 25 pgs, no figure
On the Typical Structure of Graphs in a Monotone Property
Given a graph property , it is interesting to determine the
typical structure of graphs that satisfy . In this paper, we
consider monotone properties, that is, properties that are closed under taking
subgraphs. Using results from the theory of graph limits, we show that if
is a monotone property and is the largest integer for which
every -colorable graph satisfies , then almost every graph with
is close to being a balanced -partite graph.Comment: 5 page
- …