scholarly journals Pure Pairs VI: Excluding an Ordered Tree

2022 ◽  
Vol 36 (1) ◽  
pp. 170-187
Author(s):  
Alex Scott ◽  
Paul Seymour ◽  
Sophie Spirkl
Keyword(s):  
2016 ◽  
Vol 17 (2) ◽  
pp. 1-34
Author(s):  
Michael Benedikt ◽  
Clemens Ley
Keyword(s):  

2005 ◽  
Vol 33 (4) ◽  
pp. 261-279 ◽  
Author(s):  
Jianyong Wang ◽  
Tianzhi Wang ◽  
Erik R. P. Zuiderweg ◽  
Gordon M. Crippen

1994 ◽  
Vol 77 (2) ◽  
pp. 660-670 ◽  
Author(s):  
G. S. Krenz ◽  
J. Lin ◽  
C. A. Dawson ◽  
J. H. Linehan

Model arterial trees were constructed following rules consistent with morphometric data, Nj = (Dj/Da)-beta 1 and Lj = La(Dj/Da)beta 2, where Nj, Dj, and Lj are number, diameter, and length, respectively, of vessels in the jth level; Da and La are diameter and length, respectively, of the inlet artery, and -beta 1 and beta 2 are power law slopes relating vessel number and length, respectively, to vessel diameter. Simulated heterogeneous trees approximating these rules were constructed by assigning vessel diameters Dm = Da[2/(m + 1)]1/beta 1, such that m-1 vessels were larger than Dm (vessel length proportional to diameter). Vessels were connected, forming random bifurcating trees. Longitudinal intravascular pressure [P(Qcum)] with respect to cumulative vascular volume [Qcum] was computed for Poiseuille flow. Strahler-ordered tree morphometry yielded estimates of La, Da, beta 1, beta 2, and mean number ratio (B); B is defined by Nk + 1 = Bk, where k is total number of Strahler orders minus Strahler order number. The parameters were used in P(Qcum) = Pa [formula: see text] and the resulting P(Qcum) relationship was compared with that of the simulated tree, where Pa is total arterial pressure drop, Q is flow rate, Ra = (128 microLa)/(pi D4a (where mu is blood viscosity), and Qa (volume of inlet artery) = 1/4D2a pi La. Results indicate that the equation, originally developed for homogeneous trees (J. Appl. Physiol. 72: 2225–2237, 1992), provides a good approximation to the heterogeneous tree P(Qcum).


2016 ◽  
Vol 276 ◽  
pp. 384-393 ◽  
Author(s):  
Qing Cheng ◽  
Zhong Liu ◽  
Jincai Huang ◽  
Guangquan Cheng

1996 ◽  
Vol 07 (03) ◽  
pp. 293-299 ◽  
Author(s):  
HELMUT PRODINGER

A heap ordered tree of size n is a planted plane tree together with a bijection from the nodes to the set {1,…,n} which is monotonically increasing when going from the root to the leaves. In a recent paper by Chen and Ni, the expectation and the variance of the depth of a random node in a random heap ordered tree of size n was considered. Here, we give additional results concerning level polynomials. From a historical point of view, we trace these trees back to an earlier paper by Prodinger and Urbanek and find formulae that are proved in the paper by Chen and Ni by ad hoc computations already in a classic book by Greene and Knuth. Also, we mention that a paper by Bergeron, Flajolet and Salvy develops a more general theory of increasing trees, based on simply generated families of trees. Furthermore we consider the path length which is a natural concept when dealing with the depth. Expectation and variance are obtained, both explicitly and asymptotically.


Sign in / Sign up

Export Citation Format

Share Document