Counting vertices and cubes in median graphs of circular split systems (Q2472839): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2007.02.003 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: William G. Brown / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: William G. Brown / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OEIS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2007.02.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084463402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric Ternary Distributive Semi-Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Retracts of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A canonical decomposition theory for metrics on a finite set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superextensions and the depth of median graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cube polynomial and its derivatives: The case of median graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of vertices and edges of the Buneman graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exceptional split geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(T\)-theory: An overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs Orientable as Distributive Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of the tight-span of a totally split-decomposable metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Euler-type formula for median graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2859380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5671372 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJC.2007.02.003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:43, 18 December 2024

scientific article
Language Label Description Also known as
English
Counting vertices and cubes in median graphs of circular split systems
scientific article

    Statements

    Counting vertices and cubes in median graphs of circular split systems (English)
    0 references
    0 references
    25 February 2008
    0 references
    For a given set \(\mathcal S\) (a ``split system'') of bipartitions \(S=\{A,B\}\) (called splits) of \([n]=\{1,2,\dots,n\}\) (where \(A,B\) are non-empty), the associated median graph or Buneman graph [cf. \textit{S. Klavžar, H. M. Mulder} and \textit{R. Škrekovski}, Discrete Math. 187, No. 1--3, 255--258 (1998; Zbl 0957.05031); \textit{A. Dress, M. Hendy, K. Huber} and \textit{V. Moulton}, Ann. Comb. 1, No. 4, 329--337 (1997; Zbl 0927.05077)]) is the subgraph of the \(| {\mathcal S}| \)-dimensional hypergraph with vertex-set consisting of those maps \(\varphi:{\mathcal S}\to2^{[n]}\) which, for all \(S,S^\prime\in{\mathcal S}\), satisfy \(\varphi(S)\in S\), \(\varphi(S)\cap\varphi(S^\prime)\neq\emptyset\); and edge-set consisting of those pairs of vertices \(\{\varphi,\varphi^\prime\}\) with \(| \{S\in{\mathcal S}:\varphi(S)\neq\varphi^\prime(S)\}| =1\). For \(i,j\in[n]\), the metric \(d_{\mathcal S}:[n]\times[n]\to{\mathbb R}_{\geq0}\) is given by \(d_{\mathcal S}(i,j)=| \{S\in{\mathcal S}:i,j\) are in different parts of \(S\}| \); the tight-span associated with \(\mathcal S\) is ``the polytopal complex that is given by the union of the bounded faces of the polytope in \({\mathbb R}^{[n]}\) given by \(P(d_{\mathcal S})=\{f:[n]\to{\mathbb R}| f(i)+f(j)\geq d_{\mathcal S}(i,j)\), for all \(i,j,\in[n]\}\)''. For \(n>2\), the \textit{full circular split system} \({\mathcal S}(n)\) consists of all splits of \([n]\) induced by removing 2 edges from \(C_n\) and taking the split of \([n]\) corresponding to the two connected components; \({\mathcal S}(2)\) consists of the split \(\{\{1\},\{2\}\}\); for \(1\leq m\leq\lfloor\frac n2\rfloor\), \({\mathcal S}(n,m)\) consists of the splits \(S=\{A,B\}\) in \({\mathcal S}(n)\) with \(\min\{| A| ,| B| \}=m\). The authors present formulæ and recursions for the numbers of vertices and the numbers of maximal induced subcubes in the median graphs associated with the circular split systems \({\mathcal S}(n)\) and \({\mathcal S}(n,m)\) [cf. \textit{H.-J. Bandelt} and \textit{A. W. M. Dress}, Adv. Math. 92, No. 1, 47--105 (1992; Zbl 0789.54036)]. They provide an affirmative answer to a question posed by B. Sturmfels concerning tight-spans.
    0 references
    phylogenetic combinatorics
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references