English
Related papers

Related papers: Notes on a theorem of Naji

200 papers

A simple undirected graph is said to be {\em semisymmetric} if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. It was proved in [{\em J. Combin.…

Combinatorics · Mathematics 2012-06-12 Li Wang , Shaofei Du

Let $\Gamma$ be a $G$-symmetric graph with vertex set $V$. We suppose that $V$ admits a $G$-partition $\mathcal{B} = \{ B_0, ... , B_b \}$, with parts of size $v$, and that the quotient graph induced on $\mathcal B$ is a complete graph of…

Combinatorics · Mathematics 2017-09-06 A. Gardiner , Cheryl E. Praeger

In this paper, firstly, we provide some necessary and sufficient conditions for generalized Cayley graphs on abelian groups to be bipartite. Secondly, we deduce several necessary and sufficient conditions for generalized Cayley graphs on…

Combinatorics · Mathematics 2024-12-18 Liao Qianfen , Liu Weijun , Zhang Pengli

Representations of equipped graphs were introduced by Gelfand and Ponomarev; they are similar to representation of quivers, but one does not need to choose an orientation of the graph. In a previous article we have shown that, as in Kac's…

Rings and Algebras · Mathematics 2017-12-21 William Crawley-Boevey

We consider orbit partitions of groups of automorphisms for the symplectic graph and apply Godsil-McKay switching. As a result, we find four families of strongly regular graphs with the same parameters as the symplectic graphs, including…

Combinatorics · Mathematics 2016-06-13 Sho Kubota

In this paper we present new proofs of the Conway-Gordon-Sachs and Sachs Theorems on the linked cycles in graphs embedded in $\R^3$. We reduce these theorems to certain property of graphs mapped to the plane.

Geometric Topology · Mathematics 2014-04-15 Arseny Zimin

We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]

Combinatorics · Mathematics 2014-06-17 Reinhard Diestel , Sang-il Oum

We present a proof of the formula (given in Lurie's Higher Algebra) for the operad governing diagrams of operad algebras. We believe that our proof corrects a flaw in the original argument. 2nd version: a corrected proof given.

Category Theory · Mathematics 2025-06-05 Vladimir Hinich

The conjecture of Bollob\'as and Koml\'os, recently proved by B\"ottcher, Schacht, and Taraz [Math. Ann. 343(1), 175--205, 2009], implies that for any $\gamma>0$, every balanced bipartite graph on $2n$ vertices with bounded degree and…

Combinatorics · Mathematics 2011-07-28 Julia Böttcher , Peter Christian Heinig , Anusch Taraz

We study an analogue of the Herbrand-Ribet theorem, and its refinement by Mazur and Wiles, in graph theory. For an odd prime number $p$, we let $\mathbb{F}_{p}$ and $\mathbb{Z}_{p}$ denote the finite field with $p$ elements and the ring of…

Number Theory · Mathematics 2025-04-09 Daniel Vallières , Chase A. Wilson

We use the geometry of the Farey graph to give an alternative proof of the fact that if $A \in GL_2\mathbb Z$ and $G_A=\mathbb Z^2 \rtimes_A \mathbb Z$ is generated by two elements, there is a single Nielsen equivalence class of $2$-element…

Geometric Topology · Mathematics 2017-07-25 Ian Biringer

Let $G$ be a graph of even order and let $K_{G}$ be the complete graph on the same vertex set of $G$. A pairing of a graph $G$ is a perfect matching of the graph $K_{G}$. A graph $G$ has the Pairing-Hamiltonian property (for short, the…

Combinatorics · Mathematics 2022-09-16 John Baptist Gauci , Jean Paul Zerafa

Fiol, Garriga, and Yebra introduced the notion of pseudo-distance-regular vertices, which they used to develop a new characterization of distance-regular graphs. Building on that work, Fiol and Garriga developed the spectral excess theorem…

Combinatorics · Mathematics 2022-10-14 Sabrina Lato

We prove a number of results related to the computational complexity of recognizing well-covered graphs. Let $k$ and $s$ be positive integers and let $G$ be a graph. Then $G$ is said - $\mathbf{W_k}$ if for any $k$ pairwise disjoint…

Combinatorics · Mathematics 2024-04-12 Carl Feghali , Malory Marin , Rémi Watrigant

We prove that for every bipartite graph $H$ and positive integer $s$, the class of $K_{s,s}$-subgraph-free graphs excluding $H$ as a pivot-minor has bounded average degree. Our proof relies on the announced binary matroid structure theorem…

Combinatorics · Mathematics 2026-03-24 Rutger Campbell , James Davies , Robert Hickingbotham

One can associate to a bipartite graph a so-called edge ring whose spectrum is an affine normal toric variety. We characterize the faces of the (edge) cone associated to this toric variety in terms of some independent sets of the bipartite…

Algebraic Geometry · Mathematics 2020-09-15 Irem Portakal

By using Alexander duality on simplicial complexes we give a new and algebraic proof of Dirac's theorem on chordal graphs.

Commutative Algebra · Mathematics 2007-05-23 Jürgen Herzog , Takayuki Hibi , Xinxian Zheng

Using an algebraic characterization of circle graphs, Bouchet proved in 1999 that if a bipartite graph $G$ is the complement of a circle graph, then $G$ is a circle graph. We give an elementary proof of this result.

Combinatorics · Mathematics 2020-02-19 Louis Esperet , Matěj Stehlík

Paolo Aluffi, inspired by an algebro-geometric problem, asked when the Kirchhoff polynomial of a graph is in the Jacobian ideal of the Kirchhoff polynomial of the same graph with one edge deleted. We give some results on which graph-edge…

Combinatorics · Mathematics 2017-01-11 Avi Kulkarni , Gregory Maxedon , Karen Yeats

We characterize $k$--colorability of a simplicial graph via the intrinsic algebraic structure of the associated right-angled Artin group. As a consequence, we show that a certain problem about the existence of homomorphisms from…

Group Theory · Mathematics 2020-09-30 Ramón Flores , Delaram Kahrobaei , Thomas Koberda
‹ Prev 1 8 9 10 Next ›