Access the full text.
Sign up today, get DeepDyve free for 14 days.
F. Abramson, L. Harrington (1978)
Models Without IndiscerniblesJ. Symb. Log., 43
Omer Angel, A. Kechris, R. Lyons (2012)
Random Orderings and Unique Ergodicity of Automorphism GroupsJournal of the European Mathematical Society, 16
J Nešetřil (2013)
Erdős Centennial
J. Nesetril, V. Rödl (1991)
Mathematics of Ramsey Theory
J. Nesetril, V. Rödl (1978)
On a probabilistic graph-theoretical method, 72
(1974)
Partitions of subgraphs
P. Erdös, A. Hajnal, B. Rothchild (1966)
On chromatic number of graphs and set-systemsActa Mathematica Academiae Scientiarum Hungarica, 17
J. Nesetril (2013)
A Combinatorial Classic — Sparse Graphs with High Chromatic Number
(1977)
Partitions of relational and set systems
J Nešetřil (1996)
Handbook of Combinatorics
J. Nesetril, H. Prömel, V. Rödl, B. Voigt (1985)
Canonizing Ordering Theorems for Hales Jewett StructuresJ. Comb. Theory, Ser. A, 40
In this paper, we study a Ramsey type problems dealing with the number of ordered subgraphs present in an arbitrary ordering of a larger graph. Our first result implies that for every vertex ordered graph G on k vertices and any stochastic vector $$\overrightarrow{a}$$ a → with k! entries, there exists a graph H with the following property: for any linear order of the vertices of H, the number of induced ordered copies of G in H is asymptotically equal to a convex combination of the entries in $$\overrightarrow{a}$$ a → . This for a particular choice of $$\overrightarrow{a}$$ a → yeilds an earlier result of Angel, Lyons, and Kechris. We also consider a similar question when the ordering of vertices is replaced by the ordering of pairs of vertices. This problem is more complex problem and we prove some partial results in this case.
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg – Springer Journals
Published: Jan 4, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.