Related papers: Evasive Properties of Sparse Graphs and Some Linea…
Preservation theorems provide a direct correspondence between the syntactic structure of first-order sentences and the closure properties of their respective classes of models. A line of work has explored preservation theorems relativised…
This paper is devoted to present two counterexamples to the theorem from \cite{MK} Maria R., Katherine T. M., Bernardo S. M., Extremal graphs with bounded vertex bipartiteness number, Linear Algebra Appl. 493 (2016) 28-36. Moreover, the…
In this paper, we obtain a precise estimate of the probability that the sparse binomial random graph contains a large number of vertices in a triangle. The estimate of log of this probability is correct up to second order, and enables us to…
We generalise a sparsity condition for hypergraphs and show a result relating sparseness of hypergraphs to the decomposition of a modified incidence graph into edge-disjoint forests. We also give new sparsity conditions for posets and…
We derive several upper bounds on the spectral gap of the Laplacian with standard or Dirichlet vertex conditions on compact metric graphs. In particular, we obtain estimates based on the length of a shortest cycle (girth), diameter, total…
We establish nonexistence conditions for nonnegative nontrivial solutions to a class of semilinear parabolic equations with a positive potential on weighted graphs, extending results in arXiv:2404.12058 [math.AP] to a broader setting that…
Exponential random graph models (ERGMs) are a widely used framework for network data, enabling hypothesis testing on the structural mechanisms underlying observed networks. Bayesian ERGMs provide principled uncertainty quantification and…
The main result of this article is the decomposition of tensor products of representations of SL(2) in the sum of irreducible representations parametrized by outerplanar graphs. An outerplanar graph is a graph with the vertices 0, 1, 2,…
In this paper, we give sufficient conditions on the spectral radius for a bipartite graph to Hamiltonian and traceable, which expand the results of Lu, Liu and Tian (2012) [10]. Furthermore, we also present tight sufficient conditions on…
In [Distrance-regular Cayley graphs on dihedral groups, J. Combin. Theory Ser B 97 (2007) 14--33], Miklavi\v{c} and Poto\v{c}nik proposed the problem of characterizing distance-regular Cayley graphs, which can be viewed as an extension of…
Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight $1$. In $1994$, Mahadev et al.~introduced a subclass of equistable graphs,…
We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…
In this paper, the general formulation for inextensible flows of curves on oriented surface in $\mathbb{R}^3 $ is investigated. The necessary and sufficient conditions for inextensible curve flow lying an oriented surface are expressed as a…
We give two results for deducing dynamical properties of piecewise M\"obius interval maps from their related planar extensions. First, eventual expansivity and the existence of an ergodic invariant probability measure equivalent to Lebesgue…
We establish the conditions under which several algorithmically exploitable structural features hold for random intersection graphs, a natural model for many real-world networks where edges correspond to shared attributes. Specifically, we…
We consider limit probabilities of first order properties in random graphs with a given degree sequence. Under mild conditions on the degree sequence, we show that the closure set of limit probabilities is a finite union of closed…
This report presents notes from the first eight lectures of the class Many Models of Complexity taught by Laszlo Lovasz at Princeton University in the fall of 1990. The topic is evasiveness of graph properties: given a graph property, how…
We consider quasirandom properties for Cayley graphs of finite abelian groups. We show that having uniform edge-distribution (i.e., small discrepancy) and having large eigenvalue gap are equivalent properties for such Cayley graphs, even if…
We present a unified approach to proving Ramsey-type theorems for graphs with a forbidden induced subgraph which can be used to extend and improve the earlier results of Rodl, Erdos-Hajnal, Promel-Rodl, Nikiforov, Chung-Graham, and…
We study the Erdos distance problem over finite Euclidean and non-Euclidean spaces. Our main tools are graphs associated to finite Euclidean and non-Euclidean spaces that are considered in Bannai-Shimabukuro-Tanaka (2004, 2007). These…