English
Related papers

Related papers: Strongly regular graphs from hyperbolic quadrics a…

200 papers

Strongly regular graphs (SRGs) are highly symmetric combinatorial objects, with connections to many areas of mathematics including finite fields, finite geometries, and number theory. One can construct an SRG via the Cayley Graph of a…

Combinatorics · Mathematics 2024-08-15 Andrew C. Brady

Many multiprocessor systems have interconnection networks as underlying topologies and an interconnection network is usually represented by a graph where nodes represent processors and links represent communication links between processors.…

Information Theory · Computer Science 2017-08-08 Shiying Wang , Xiaolei Ma

We quantize the regularity properties of classical graphs that determine spin models for singly-generated Yang-Baxter planar algebras, including the Kauffman polynomial, and construct explicit examples. A source of examples comes from…

Operator Algebras · Mathematics 2026-02-16 Néstor Bravo Hernández , Roberto Hernández Palomares , Fabio Viales Solís

A graph is IC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share no common end vertex. IC-planarity specializes both NIC-planarity, which allows a pair of crossing…

Discrete Mathematics · Computer Science 2017-07-28 Christian Bachmaier , Franz J. Brandenburg , Kathrin Hanauer

In this work, we define an orthogonal graph on the set of equivalence classes of $(2\nu + \delta)-$tuples over $\mathbb{Z}_{2^n}$ where $n$ and $\nu$ are positive integers and $\delta = 0, 1$ or $2$. We classify our graph if it is strongly…

Combinatorics · Mathematics 2019-01-07 Songpon Sriwongsa

An $r$-quasiplanar graph is a graph drawn in the plane with no $r$ pairwise crossing edges. Let $s \geq 3$ be an integer and $r=2^s$. We prove that there is a constant $C$ such that every $r$-quasiplanar graph with $n \geq r$ vertices has…

Combinatorics · Mathematics 2022-10-26 Jacob Fox , Janos Pach , Andrew Suk

For any positive integer $m$, the complete graph on $2^{2m}(2^m+2)$ vertices is decomposed into $2^m+1$ commuting strongly regular graphs, which give rise to a symmetric association scheme of class $2^{m+2}-2$. Furthermore, the…

Combinatorics · Mathematics 2017-01-23 Hadi Kharaghani , Sara Sasani , Sho Suda

Let N be the moduli space of stable rank 2 quasiparabolic vector bundles of fixed degree on the projective line with 2g+1 marked points, where g>1, and stability is with respect to the weights {0,1/2} at each marked point. In this note we…

Algebraic Geometry · Mathematics 2014-10-14 C. Casagrande

Given a fixed graph $H$ and a constant $c \in [0,1]$, we can ask what graphs $G$ with edge density $c$ asymptotically maximize the homomorphism density of $H$ in $G$. For all $H$ for which this problem has been solved, the maximum is always…

Combinatorics · Mathematics 2023-04-12 Grigoriy Blekherman , Shyamal Patel

Let $C_{n,g}$ be the number of rooted cubic maps with $2n$ vertices on the orientable surface of genus $g$. We show that the sequence $(C_{n,g}:g\ge 0)$ is asymptotically normal with mean and variance asymptotic to $(1/2)(n-\ln n)$ and…

Combinatorics · Mathematics 2023-07-11 Zhicheng Gao

A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. A graph is well-covered if all its maximal stable sets are of the same size, co-well-covered if its complement is well-covered, and…

Combinatorics · Mathematics 2016-08-08 Edward Dobson , Ademir Hujdurović , Martin Milanič , Gabriel Verret

The theory of dense graph limits comes with a natural sampling process which yields an inhomogeneous variant G(n,W) of the Erdos-Renyi random graph. Here we study the clique number of these random graphs. We establish the concentration of…

Combinatorics · Mathematics 2018-12-04 Martin Doležal , Jan Hladký , András Máthé

This is a report on a failed attempt to construct new graphs that are strongly regular with no triangles. The approach is based on the assumption that the second subconstituent has an equitable partition with four parts. For infinitely many…

Combinatorics · Mathematics 2010-03-02 Norman Biggs

Given an integer $k$, deciding whether a graph has a clique of size $k$ is an NP-complete problem. Wilf's inequality provides a spectral bound for the clique number of simple graphs. Wilf's inequality is stated as follows: $\frac{n}{n -…

Discrete Mathematics · Computer Science 2025-04-08 Hareshkumar Jadav , Sreekara Madyastha , Rahul Raut , Ranveer Singh

We prove that random hypergraphs are asymptotically almost surely resiliently Hamiltonian. Specifically, for any $\gamma>0$ and $k\ge3$, we show that asymptotically almost surely, every subgraph of the binomial random $k$-uniform hypergraph…

Combinatorics · Mathematics 2021-05-11 Peter Allen , Olaf Parczyk , Vincent Pfenninger

Let $G_n$ be a random geometric graph, and then for $q,p \in [0,1)$ we construct a "$(q,p)$-perturbed noisy random geometric graph" $G_n^{q,p}$ where each existing edge in $G_n$ is removed with probability $q$, while and each non-existent…

Combinatorics · Mathematics 2022-08-24 Matthew Kahle , Minghao Tian , Yusu Wang

Let $H$ be a graph on $h$ vertices. The number of induced copies of $H$ in a graph $G$ is denoted by $i_H(G)$. Let $i_H(n)$ denote the maximum of $i_H(G)$ taken over all graphs $G$ with $n$ vertices. Let $f(n,h) = \Pi_{i}^h a_i$ where…

Combinatorics · Mathematics 2018-01-16 Raphael Yuster

A semigroup generated by two dimensional $C^{1+\alpha}$ contracting maps is considered. We call a such semigroup regular if the maximum $K$ of the conformal dilatations of generators, the maximum $l$ of the norms of the derivatives of…

Dynamical Systems · Mathematics 2016-09-06 Yunping Jiang

The paper consists of two parts. In the first one we show that a relatively hyperbolic group $G$ splits as a star graph of groups whose central vertex group is finitely generated and the other vertex groups are maximal parabolic subgroups.…

Group Theory · Mathematics 2015-02-20 Victor Gerasimov , Leonid Potyagailo

Let $G$ be a Cayley graph of the elementary abelian $2$-group $\mathbb{Z}_2^{n}$ with respect to a set $S$ of size $d$. We prove that for any such $G, S$ and $d$, the maximum degree of any induced subgraph of $G$ on any set of more than…

Combinatorics · Mathematics 2020-11-10 Noga Alon , Kai Zheng
‹ Prev 1 8 9 10 Next ›