Related papers: Univoque graphs and multiple expansions
The independence polynomial $i(G,x)$ of a graph $G$ is the generating function of the numbers of independent sets of each size. A graph of order $n$ is very well-covered if every maximal independent set has size $n/2$. Levit and Mandrescu…
We show that the set of numbers that are $Q$-distribution normal but not simply $Q$-ratio normal has full Hausdorff dimension. It is further shown under some conditions that countable intersections of sets of this form still have full…
Let $i_t(G)$ be the number of independent sets of size $t$ in a graph $G$. Alavi, Erd\H{o}s, Malde and Schwenk made the conjecture that if $G$ is a tree then the independent set sequence $\{i_t(G)\}_{t\geq 0}$ of $G$ is unimodal; Levit and…
We enumerate the connected graphs that contain a linear number of edges with respect to the number of vertices. So far, only the first term of the asymptotics was known. Using analytic combinatorics, i.e. generating function manipulations,…
In this paper, we count the number of independent sets of a type of graph $G(\mathcal{A},q)$ associated to some hyperplane arrangement $\mathcal{A}$, which is a generalization of the construction of graphical arrangements. We show that when…
The question of finding expander graphs with strong vertex expansion properties such as unique neighbor expansion and lossless expansion is central to computer science. A barrier to constructing these is that strong notions of expansion…
Ordered sequences of univariate or multivariate regressions provide statistical models for analysing data from randomized, possibly sequential interventions, from cohort or multi-wave panel studies, but also from cross-sectional or…
Expansion of real numbers is a basic research topic in number theory. Usually we expand real numbers in one given base. In this paper, we begin to systematically study expansions in multiple given bases in a reasonable way, which is a…
Graphical models have proven to be powerful tools for representing high-dimensional systems of random variables. One example of such a model is the undirected graph, in which lack of an edge represents conditional independence between two…
Firstly, we completely determine the self-similar Hausdorff spectrum of the group of $q$-adic automorphisms where $q$ is a prime power, answering a question of Grigorchuk. Indeed, we take a further step and completely determine its…
Jacobian conjectures (that nonsingular implies invertible) for rational everywhere defined maps of real n-space to itself are considered, with no requirement for a constant Jacobian determinant or a rational inverse. The associated…
Expansions in noninteger positive bases have been intensively investigated since the pioneering works of R\'enyi (1957) and Parry (1960). The discovery of surprising unique expansions in certain noninteger bases by Erd\H os, Horv\'ath and…
We describe two constructions of (very) dense graphs which are edge disjoint unions of large {\em induced} matchings. The first construction exhibits graphs on $N$ vertices with ${N \choose 2}-o(N^2)$ edges, which can be decomposed into…
Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Ba\v{s}i\'c, Fowler and Pisanski proved that the automorphism group of a nut graph has…
For any graph $G$ on $n$ vertices and for any {\em symmetric} subgraph $J$ of $K_{n,n}$, we construct an infinite sequence of graphs based on the pair $(G,J)$. The First graph in the sequence is $G$, then at each stage replacing every…
A graph is well-covered if all its maximal independent sets are of the same size (M. D. Plummer, 1970). A well-covered graph is 1-well-covered if the deletion of every vertex leaves a graph which is well-covered as well (J. W. Staples,…
We prove a tight upper bound on the independence polynomial (and total number of independent sets) of cubic graphs of girth at least 5. The bound is achieved by unions of the Heawood graph, the point/line incidence graph of the Fano plane.…
We give constructive proofs for the existence of uniquely hamiltonian graphs for various sets of degrees. We give constructions for all sets with minimum 2 (a trivial case added for completeness), all sets with minimum 3 that contain an…
Given an integer $N\ge 2$ and a real number ${\beta}>1$, let $\Gamma_{{\beta},N}$ be the set of all $x=\sum_{i=1}^\infty {d_i}/{{\beta}^i}$ with $d_i\in\{0,1,\cdots,N-1\}$ for all $i\ge 1$. The infinite sequence $(d_i)$ is called a…
Following a general program of studying limits of discrete structures, and motivated by the theory of limit objects of converge sequences of dense simple graphs, we study the limit of graph sequences such that every edge is labeled by an…