Results 101 to 110 of about 193 (154)
Ramsey-Type Results for Oriented Trees
, 2007 . For a graph G and a digraph ~ H, we write G! ~ H (respectively, G a ! ~ H) if every orientation (respectively, acyclic orientation) of the edges of G results in an induced copy of ~ H. In this note we study how small the graphs G such that G!
Vojtech Rödl +2 more
core
Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes. [PDF]
J Math Biol, 2021 Gross E +5 more
europepmc +1 more source
Ramsey Goodness of Bounded Degree Trees
, 2018 Given a pair of graphs G and H, the Ramsey number R(G, H) is the smallest N such that every red-blue coloring of the edges of the complete graph KN contains a red copy of G or a blue copy of H.
Pokrovskiy, A, Balla, I, Sudakov, B
core
An efficient characterization of submodular spanning tree games. [PDF]
Math Program, 2020 Koh ZK, Sanità L.
europepmc +1 more source
A Note on Major Sequences and External Activity in Trees
, 1996 A bijection is given from major sequences of length n (a variant of parking functions) to trees on f0; : : : ; ng that maps a sequence with sum \Gamma n+1 2 \Delta + k to a tree with external activity k. Key Words: Major sequence, external activity,
Janet S. Beissinger, Uri N. Peled
core
The rigid hybrid number for two phylogenetic trees. [PDF]
J Math Biol, 2021 Huber KT, Linz S, Moulton V.
europepmc +1 more source
Mathematisches Forschungsinstitut Oberwolfach Report No. 52/2006 Mini-Workshop:
, 2006 . This is a collection of extended abstracts of a mini-workshop “Logic, Combinatorics and Independence results ” that took place on November 25 – December 2, 2006 in Oberwolfach.
Andrey Bovykin (liverpool +2 more
core
Symplectic Runge-Kutta Schemes II: Classification Of Symmetric Methods
. A complete classification of all symplectic self-adjoint Runge-Kutta methods with up to 6 stages is given and the derivation process used is outlined.
M. Sofroniou, W. Oevel
core
A Greedy Algorithm Estimating The Height Of Random Trees
, 2007 . The behaviour of a greedy algorithm which estimates the height of a random labelled rooted tree is studied. A self-similarity argument is used to characterize the limit distribution of the length H of the path found by such an algorithm in a random ...
Tomasz Luczaky
core
Inhomogeneous Continuum Random Trees and the Entrance Boundary of the Additive Coalescent
, 1998 Regard an element of the set of ranked discrete distributions \Delta := f(x 1 ; x 2 ; : : :) : x 1 x 2 : : : 0; P i x i = 1g as a fragmentation of unit mass into clusters of masses x i .
Jim Pitman, David Aldous
core