English
Related papers

Related papers: The Evasiveness Conjecture and Graphs on 2p Vertic…

200 papers

We give an unconditional version of a conditional, on the Extended Riemann Hypothesis, result of L. Babai, A. Banerjee, R. Kulkarni and V. Naik (2010) on the evasiveness of sparse graphs.

Computational Complexity · Computer Science 2013-04-05 Igor Shparlinski

Uncover the vertices of a given graph, deterministic or random, in random order; we consider both a discrete-time and a continuous-time version. We study the evolution of the number of visible edges, and show convergence after normalization…

Probability · Mathematics 2023-12-22 Svante Janson

A graph $X$ is said to be "unstable" if the direct product $X \times K_2$ (also called the canonical double cover of $X$) has automorphisms that do not come from automorphisms of its factors $X$ and $K_2$. It is "nontrivially unstable" if…

Combinatorics · Mathematics 2022-01-11 Ademir Hujdurović , Đorđe Mitrović , Dave Witte Morris

We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…

Dynamical Systems · Mathematics 2023-08-29 Anush Tserunyan

Given a function $g=g(n)$ we let ${\mathcal E}^g$ be the class of all graphs $G$ such that if $G$ has order $n$ (that is, has $n$ vertices) then it is embeddable in some surface of Euler genus at most $g(n)$, and let ${\widetilde{\mathcal…

Combinatorics · Mathematics 2021-08-11 Colin McDiarmid , Sophia Saller

We examine the Maximum Independent Set Problem in an undirected graph. The main result is that this problem can be considered as the solving the same problem in a subclass of the weighted normal twin-orthogonal graphs. The problem is…

Data Structures and Algorithms · Computer Science 2016-03-08 Anatoly D. Plotnikov

Veit Elser proposed a random graph model for percolation in which physical dimension appears as a parameter. Studying this model combinatorially leads naturally to the consideration of numerical graph invariants which we call \emph{Elser…

For a graph $G$ and a parameter $k$, we call a vertex $k$-enabling if it belongs both to a clique of size $k$ and to an independent set of size $k$, and we call it $k$-excluding otherwise. Motivated by issues that arise in secret sharing…

Data Structures and Algorithms · Computer Science 2025-09-03 Uriel Feige , Ilia Pauzner

We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…

Group Theory · Mathematics 2024-01-10 Amandine Escalier , Camille Horbez

We consider classes of pseudo-random graphs on $n$ vertices for which the degree of every vertex and the co-degree between every pair of vertices are in the intervals $(np - Cn^\delta,np+Cn^\delta)$ and $(np^2- C n^\delta, np^2 +C…

Probability · Mathematics 2016-10-13 Anirban Basak , Shankar Bhamidi , Suman Chakraborty , Andrew Nobel

We investigate the threshold probability for connectivity of sparse graphs under weak assumptions. As a corollary this completely solve the problem for Cartesian powers of arbitrary graphs. In detail, let $G$ be a connected graph on $k$…

Combinatorics · Mathematics 2013-12-04 Felix Joos

A graph $X$ is said to be unstable if the direct product $X \times K_2$ (also called the canonical double cover of $X$) has automorphisms that do not come from automorphisms of its factors $X$ and $K_2$. It is nontrivially unstable if it is…

Combinatorics · Mathematics 2021-08-12 Ademir Hujdurović , Đorđe Mitrović , Dave Witte Morris

Let $\Gamma$ be a simple connect graph on a finite vertex set $V$ and let $A$ be its adjacency matrix. Then $\Gamma$ is said to be \textit{singular} if and only if $0$ is an eigenvalue of $A.$ The \textit{nullity (singularity)} of $\Gamma,$…

Combinatorics · Mathematics 2018-10-09 Ali Sltan Ali AL-Tarimshawy

In this paper we study three substructures in hypergraphs that generalize the notion of an Euler tour in a graph. A flag-traversing tour of a hypergraph corresponds to an Euler tour of its incidence graph, hence complete characterization of…

Combinatorics · Mathematics 2016-08-04 M. Amin Bahmanian , Mateja Šajna

In this paper, generalized Cayley graphs are studied. It is proved that every generalized Cayley graph of order 2p is a Cayley graph, where p is a prime. Special attention is given to generalized Cayley graphs on Abelian groups. It is…

Combinatorics · Mathematics 2015-12-02 Ademir Hujdurović , Klavdija Kutnar , Pawel Petecki , Anastasiya Tanana

We provide a generating function for the (graded) dimensions of M. Kontsevich's graph complexes of ordinary graphs. This generating function can be used to compute the Euler characteristic in each loop order. Furthermore, we show that…

Quantum Algebra · Mathematics 2015-02-23 Thomas Willwacher , Marko Živković

We study properties of automorphisms of graph products of groups. We show that graph product $\Gamma\mathcal{G}$ has non-trivial pointwise inner automorphisms if and only if some vertex group corresponding to a central vertex has…

Group Theory · Mathematics 2016-10-13 Michal Ferov

If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…

Combinatorics · Mathematics 2013-03-25 Michal Adamaszek

We consider the class of quasiprojective varieties admitting a dominant morphism onto a curve with negative Euler characteristic. The existence of such a morphism is a property of the fundamental group. We show that for a variety in this…

Algebraic Geometry · Mathematics 2007-05-23 T. Bandman , A. Libgober

A subgroup of the automorphism group of a graph $\G$ is said to be {\em half-arc-transitive} on $\G$ if its action on $\G$ is transitive on the vertex set of $\G$ and on the edge set of $\G$ but not on the arc set of $\G$. Tetravalent…

Combinatorics · Mathematics 2023-06-05 Iva Antončič , Primož Šparl
‹ Prev 1 4 5 6 7 8 10 Next ›