scholarly journals EXTREMAL THEORY OF ORDERED GRAPHS

Author(s):  
GÁBOR TARDOS
2014 ◽  
Vol 31 (5) ◽  
pp. 1539-1554
Author(s):  
Ruijuan Li ◽  
Xinhong Zhang ◽  
Qiaoping Guo
Keyword(s):  

1994 ◽  
Vol 51 (1-2) ◽  
pp. 113-116 ◽  
Author(s):  
Jaroslav Nešetřil
Keyword(s):  

2010 ◽  
Vol 110 (16) ◽  
pp. 651-654 ◽  
Author(s):  
Ruijuan Li
Keyword(s):  

10.37236/799 ◽  
2008 ◽  
Vol 15 (1) ◽  
Author(s):  
Martin Klazar

For classes ${\cal O}$ of structures on finite linear orders (permutations, ordered graphs etc.) endowed with containment order $\preceq$ (containment of permutations, subgraph relation etc.), we investigate restrictions on the function $f(n)$ counting objects with size $n$ in a lower ideal in $({\cal O},\preceq)$. We present a framework of edge $P$-colored complete graphs $({\cal C}(P),\preceq)$ which includes many of these situations, and we prove for it two such restrictions (jumps in growth): $f(n)$ is eventually constant or $f(n)\ge n$ for all $n\ge 1$; $f(n)\le n^c$ for all $n\ge 1$ for a constant $c>0$ or $f(n)\ge F_n$ for all $n\ge 1$, $F_n$ being the Fibonacci numbers. This generalizes a fragment of a more detailed theorem of Balogh, Bollobás and Morris on hereditary properties of ordered graphs.


2016 ◽  
Vol 339 (7) ◽  
pp. 1871-1877
Author(s):  
László Ozsvárt
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document