<ruby id="d9npn"></ruby>

<sub id="d9npn"><progress id="d9npn"></progress></sub>

<nobr id="d9npn"></nobr>

<rp id="d9npn"><big id="d9npn"><th id="d9npn"></th></big></rp>

<th id="d9npn"><meter id="d9npn"></meter></th>

# Questions tagged [trees]

A tree is a connected graph without cycles, with a finite or infinite number of vertices. There are many variants of trees, according to further constraints or decorations.

131 questions
464 views

### Groups acting on trees

Assume that $X$ is a tree such that every vertex has infinite degree, and a discrete group $G$ acts on this tree properly (with finite stabilizers) and transitively. Is it true that $G$ contains a ...
60 views

### Treewidth problem equivalence

Say we are solving a tree decomposition problem, e.g. given a graph $G = (V, E)$ we try to find a chordal graph $H$ such that $V(H) = V(G)$, $E(G) \in E(H)$ and the maximal clique in $H$ is minimal ...
30 views

### Admissible (unitary) spherical representation $sl(2,Q_p)$. Does dimension fixed point vector increase proportional index

I am using terminology of Cartier's Harmonic analysis on trees. Take $\pi$ be one of the irreducible principal or complementary (unitary) spehrical series of $Sl(2, Q_p)$. Let $K$ be the maximal ...
592 views

120 views

### Are there Prüfer sequences for rooted forests?

One well-known, extremely slick proof of Cayley's tree enumeration theorem is the use of Prüfer sequences. Cayley also proved a version for forests, namely that the number of forests with $n$ ...
110 views

### Two disjoint trees

Let $G$ be a graph and let $A_1, A_2 \subseteq V(G)$ be disjoint sets of vertices. Let us call $(A_1, A_2)$ independent if there exist vertex-disjoint trees $T_1, T_2 \subseteq G$ within $G$ which ...
74 views

### Partitioning the vertices of a graph into induced trees

I am looking for previous work regarding graphs whose vertices can be assigned colours (not necessarily a proper colouring) in such a way that each colour class induces a tree. In particular I am ...
33 views

### The number of Laplacian eigenvalues of a graph in interval [k,n]

There are several upper and lower bounds for $m_G[2,n]$ (the number of Laplacian eigenvalues of a graph $G$ with $n$ vertices in the interval $[2,n]$). I want to know whether there exists any bound ...
182 views

Let a "promenade" on a tree be a walk going through every edge of the tree at least once, and such that the starting point and endpoint of the walk are distinct. What we mean by isomorphic promenades ...
42 views

### Shattering/covering finite trees, and a simple looking inequality

Consider the tree $T$ with the set of its maximal elements (denoted $[T]$) equal to $\prod_{m\leq n} X_m$ for some finite sets $X_0,..., X_n$. Let \$p(T)=\{b: b\in \prod_{i\leq m \leq j } X_{m}\text{ ...

15 30 50 per page
特码生肖图
<ruby id="d9npn"></ruby>

<sub id="d9npn"><progress id="d9npn"></progress></sub>

<nobr id="d9npn"></nobr>

<rp id="d9npn"><big id="d9npn"><th id="d9npn"></th></big></rp>

<th id="d9npn"><meter id="d9npn"></meter></th>

<ruby id="d9npn"></ruby>

<sub id="d9npn"><progress id="d9npn"></progress></sub>

<nobr id="d9npn"></nobr>

<rp id="d9npn"><big id="d9npn"><th id="d9npn"></th></big></rp>

<th id="d9npn"><meter id="d9npn"></meter></th>