2 research outputs found
Supersaturation for hereditary properties
Let be a collection of -uniform hypergraphs, and let . It is known that there exists such that the
probability of a random -graph in not containing an induced
subgraph from is . Let each graph in
have at least vertices. We show that in fact for every
, there exists
such that the probability of a random -graph in containing less
than induced subgraphs each lying in is at most
.
This statement is an analogue for hereditary properties of the
supersaturation theorem of Erd\H{o}s and Simonovits. In our applications we
answer a question of Bollob\'as and Nikiforov.Comment: 5 pages, submitted to European Journal of Combinatoric
Consistent random vertex-orderings of graphs
Given a hereditary graph property , consider distributions of
random orderings of vertices of graphs that are preserved
under isomorphisms and under taking induced subgraphs. We show that for many
properties the only such random orderings are uniform, and give
some examples of non-uniform orderings when they exist