Related papers: Independent set sequence of some linear hypertrees
This paper is interested in independent sets (or equivalently, cliques) in uniform random cographs. We also study their permutation analogs, namely, increasing subsequences in uniform random separable permutations. First, we prove that,…
Trees fill many extremal roles in graph theory, being minimally connected and serving a critical role in the definition of $n$-good graphs. In this article, we consider the generalization of trees to the setting of $r$-uniform hypergraphs…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
We consider the number of independent sets in hypergraphs, which allows us to define the independence density of countable hypergraphs. Hypergraph independence densities include a broad family of densities over graphs and relational…
In this work, we investigate the spectrum of singularities of random stable trees with parameter $\gamma\in(1,2)$. We consider for that purpose the scaling exponents derived from two natural measures on stable trees: the local time $\ell^a$…
We study the spectra of quantum trees of finite cone type. These are quantum graphs whose geometry has a certain homogeneity, and which carry a finite set of edge lengths, coupling constants and potentials on the edges. We show the spectrum…
We prove that every amenable one-ended Cayley graph has an invariant spanning tree of one end. More generally, for any 1-ended amenable unimodular random graph we construct a factor of iid percolation (jointly unimodular subgraph) that is…
We study isometric actions of tree automorphism groups on the infinite-dimensional hyperbolic spaces. On the one hand, we exhibit a general one-parameter family of such representations and analyse the corresponding equivariant embeddings of…
If for any $k$ the $k$-th coefficient of a polynomial I(G;x) is equal to the number of stable sets of cardinality $k$ in the graph $G$, then it is called the independence polynomial of $G$ (Gutman and Harary, 1983). Let $a$ be the size of a…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
Completely independent spanning trees in a graph $G$ are spanning trees of $G$ such that for any two distinct vertices of $G$, the paths between them in the spanning trees are pairwise edge-disjoint and internally vertex-disjoint. In this…
A set of graphs is said to be independent if there is no homomorphism between distinct graphs from the set. We consider the existence problems related to the independent sets of countable graphs. While the maximal size of an independent set…
Motivated by the study of random temporal networks, we introduce a class of random trees that we coin \emph{uniform temporal trees}. A uniform temporal tree is obtained by assigning independent uniform $[0,1]$ labels to the edges of a…
We develop a family-based route to unicyclic graphs whose independence polynomials are unimodal but not log-concave. The paper is organized around one flagship statement: for the explicit KL-closure family $U_{k,r}$, with $r\in\{0,1,2\}$…
In this paper we study the maximum number of hyperedges which may be in an $r$-uniform hypergraph under the restriction that no pair of vertices has more than $t$ Berge paths of length $k$ between them. When $r=t=2$, this is the even-cycle…
We prove the following indistinguishability theorem for $k$-tuples of trees in the uniform spanning forest of $\mathbb{Z}^d$: Suppose that $\mathscr{A}$ is a property of a $k$-tuple of components that is stable under finite modifications of…
We continue the study of graph classes in which the treewidth can only be large due to the presence of a large clique, and, more specifically, of graph classes with bounded tree-independence number. In [Dallard, Milani\v{c}, and…
We give a precise description of combed trees in terms of Kelly-Mac Lane graphs. We show that any combed tree is uniquely expressed as an allowable Kelly-Mac Lane graph of a certain shape. Conversely, we show that any such Kelly-Mac Lane…
A set $S$ of vertices in a hypergraph is \textit{strongly independent} if every hyperedge shares at most one vertex with $S$. We prove a sharp result for the number of maximal strongly independent sets in a $3$-uniform hypergraph analogous…
We extend the results of Zhang et al. to show that $\lambda$ is an eigenvalue of a $k$-uniform hypertree $(k \geq 3)$ if and only if it is a root of a particular matching polynomial for a connected induced subtree. We then use this to…