中文
相关论文

相关论文: Essential Kurepa trees versus essential Jech---Kun…

200 篇论文

An evolutionary tree is a rooted tree where each internal vertex has at least two children and where the leaves are labeled with distinct symbols representing species. Evolutionary trees are useful for modeling the evolutionary history of…

计算工程、金融与科学 · 计算机科学 2007-05-23 Ming-Yang Kao

Two graphs are of the same topological type if they can be mutually embedded into each other topologically. We show that there are exactly $\aleph_1$ distinct topological types of countable trees. In general, for any infinite cardinal…

组合数学 · 数学 2023-05-24 Thilo Krill , Max Pitz

The purpose of this article is to prove that the forcing axiom for completely proper forcings is inconsistent with the Continuum Hypothesis. This answers a longstanding problem of Shelah. The corresponding completely proper forcing which…

逻辑 · 数学 2012-08-06 Justin Tatch Moore

An $\alpha$-thin tree $T$ of a graph $G$ is a spanning tree such that every cut of $G$ has at most an $\alpha$ proportion of its edges in $T$. The Thin Tree Conjecture proposes that there exists a function $f$ such that for any $\alpha >…

计算复杂性 · 计算机科学 2026-01-01 Alice Moayyedi

The MULTICUT IN TREES problem consists in deciding, given a tree, a set of requests (i.e. paths in the tree) and an integer k, whether there exists a set of k edges cutting all the requests. This problem was shown to be FPT by Guo and…

离散数学 · 计算机科学 2009-02-09 Nicolas Bousquet , Jean Daligault , Stephan Thomasse , Anders Yeo

The strong tree property and ITP (also called the super tree property) are generalizations of the tree property that characterize strong compactness and supercompactness up to inaccessibility. That is, an inaccessible cardinal $\kappa$ is…

逻辑 · 数学 2023-12-19 William Adkisson

An amoeba is a tree together with instructions how to iteratively grow trees by adding paths of a fixed length $\ell$. This paper analyses such a growth process. An amoeba is mortal if all versions of the process are finite, and it is…

组合数学 · 数学 2025-04-18 Vladimir Gurvich , Matjaž Krnc , Mikhail Vyalyi

A drawing of a given (abstract) tree that is a minimum spanning tree of the vertex set is considered aesthetically pleasing. However, such a drawing can only exist if the tree has maximum degree at most 6. What can be said for trees of…

计算几何 · 计算机科学 2015-11-17 Ferran Hurtado , Giuseppe Liotta , David R. Wood

This paper is a contribution to the problem of counting geometric graphs on point sets. More concretely, we look at the maximum numbers of non-crossing spanning trees and forests. We show that the so-called double chain point configuration…

组合数学 · 数学 2013-10-23 Clemens Huemer , Anna de Mier

Let s(A) denote the number of automorphisms of a model A of power omega_1. We derive a necessary and sufficient condition in terms of trees for the existence of an A with omega_1 < s(A) < 2^{omega_1}. We study the sufficiency of some…

逻辑 · 数学 2016-09-06 Saharon Shelah , Heikki Tuuri , Jouko Väänänen

We say that a real X is n-generic relative to a perfect tree T if X is a path through T and for all Sigma^0_n (T) sets S, there exists a number k such that either X|k is in S or for all tau in T extending X|k we have tau is not in S. A real…

逻辑 · 数学 2008-07-19 Bernard A. Anderson

A new 2-parameter family of central structures in trees, called central forests, is introduced. Minieka's $m$-center problem and McMorris's and Reid's central-$k$-tree can be seen as special cases of central forests in trees. A central…

组合数学 · 数学 2008-09-03 Shrisha Rao , Babita Grover

If $\kappa$ is regular and $2^{<\kappa}\leq\kappa^+$, then the existence of a weakly presaturated ideal on $\kappa^+$ implies $\square^*_\kappa$. This partially answers a question of Foreman and Magidor about the approachability ideal on…

逻辑 · 数学 2020-10-01 Sean Cox , Monroe Eskew

This paper continues a line of investigation of the Halpern--L\"{a}uchli Theorem at uncountable cardinals. We prove in ZFC that the Halpern--L\"{a}uchli Theorem for one tree of height $\kappa$ holds whenever $\kappa$ is strongly…

逻辑 · 数学 2023-01-03 Natasha Dobrinen , Saharon Shelah

A little over 25 years ago Pemantle pioneered the study of the contact process on trees, and showed that the critical values $\lambda_1$ and $\lambda_2$ for global and local survival were different. Here, we will consider the case of trees…

Shrub-depth and rank-depth are dense analogues of the tree-depth of a graph. It is well known that a graph has large tree-depth if and only if it has a long path as a subgraph. We prove an analogous statement for shrub-depth and rank-depth,…

组合数学 · 数学 2022-10-05 O-joung Kwon , Rose McCarty , Sang-il Oum , Paul Wollan

We generalize the results from [X.-D. Zhang, X.-P. Lv, Y.-H. Chen, \textit{Ordering trees by the Laplacian coefficients}, Linear Algebra Appl. (2009), doi:10.1016/j.laa.2009.04.018] on the partial ordering of trees with given diameter. For…

组合数学 · 数学 2015-03-19 Aleksandar Ili\' c

When gene copies are sampled from various species, the resulting gene tree might disagree with the containing species tree. The primary causes of gene tree and species tree discord include lineage sorting, horizontal gene transfer, and gene…

种群与进化 · 定量生物学 2010-03-08 Louxin Zhang

In this paper, we consider the edge disjoint caterpillar realizations of tree degree sequences. We give the necessary and sufficient conditions when two tree degree sequences have edge disjoint caterpillar realizations. We conjecture that…

组合数学 · 数学 2019-05-16 István Miklós , Geneva Schlafly , Yuheng Wang , Zhangyang Wei

Answering a question of Sakai, we show that the existence of an $\omega_1$-Erd\H{o}s cardinal suffices to obtain the consistency of Chang's Conjecture with $\square_{\omega_1, 2}$. By a result of Donder this is best possible. We also give…

逻辑 · 数学 2019-09-25 Itay Neeman , John Susice