English
Related papers

Related papers: Regular self-dual and self-Petrie-dual maps of arb…

200 papers

In this paper, we introduce the notion of 2-boundary planar graphs. A graph is 2-boundary planar if it has an embedding in the plane so that all vertices lie on the boundary of at most two faces and no edges are crossed. A proper coloring…

Combinatorics · Mathematics 2025-04-07 Weichan Liu , Mengke Qi , Xin Zhang

We show that the multiplicity of the second normalized adjacency matrix eigenvalue of any connected graph of maximum degree $\Delta$ is bounded by $O(n \Delta^{7/5}/\log^{1/5-o(1)}n)$ for any $\Delta$, and by…

Combinatorics · Mathematics 2023-06-19 Theo McKenzie , Peter M. R. Rasmussen , Nikhil Srivastava

We study Le Potier's strange duality conjecture on $\mathbb{P}^2$. We focus on the strange duality map $SD_{c_n^r,d}$ which involves the moduli space of rank $r$ sheaves with trivial first Chern class and second Chern class $n$, and the…

Algebraic Geometry · Mathematics 2018-07-25 Yao Yuan

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…

Combinatorics · Mathematics 2023-08-29 Xiongfeng Zhan , Lu Lu , Xueyi Huang

We analyze the Odd/odd vertex removal game introduced by P. Ottaway. We prove that every bipartite graph has Grundy value 0 or 1 only depending on the parity of the number of edges in the graph, which is a generalization of a conjecture of…

Combinatorics · Mathematics 2013-05-01 Oliver Krüger

An $r$-regular graph is an $r$-graph, if every odd set of vertices is connected to its complement by at least $r$ edges. Seymour [On multicolourings of cubic graphs, and conjectures of Fulkerson and Tutte.~\emph{Proc.~London…

Combinatorics · Mathematics 2026-05-29 Yulai Ma , Eckhard Steffen , Isaak H. Wolf , Junxue Zhang

In this paper we prove the semi-circular law for the eigenvalues of regular random graph $G_{n,d}$ in the case $d\rightarrow \infty$, complementing a previous result of McKay for fixed $d$. We also obtain a upper bound on the infinity norm…

Combinatorics · Mathematics 2010-12-01 Linh Tran , Van Vu , Ke Wang

We classify all rational functions whose branching pattern above {0, 1, infinity} satisfy a certain regularity condition with precisely d=5 exceptions. This work is motivated by solving second order linear differential equations, with d=5…

Combinatorics · Mathematics 2018-06-04 Mark van Hoeij , Vijay Jung Kunwar

For integers $k \geq 2$ and $n \geq k+1$, we prove the following: If $n\cdot k$ is even, there is a connected $k$-regular graph on $n$ vertices. If $n\cdot k$ is odd, there is a connected nearly $k$-regular graph on $n$ vertices.

Combinatorics · Mathematics 2018-01-26 Ghurumuruhan Ganesan

A $k$-orbit map is a map with its automorphism group partitioning the set of flags into $k$ orbits. Recently $k$-orbit maps were studied by Orbani\' c, Pellicer and Weiss, for $k \leq 4$. In this paper we use symmetry type graphs to extend…

Combinatorics · Mathematics 2013-02-01 Isabel Hubard , Alen Orbanić , Tomaž Pisanski , María del Río Francos

Semi-Equivelar maps are generalizations of Archimedean Solids (as are equivelar maps of the Platonic solids) to the surfaces other than $2-$Sphere. We classify some semi equivelar maps on surface of Euler characteristic -1 and show that…

Geometric Topology · Mathematics 2011-01-18 Ashish K. Upadhyay , Anand K. Tiwari , Dipendu Maity

We consider nonregular graphs having precisely three distinct eigenvalues. The focus is mainly on the case of graphs having two distinct valencies and our results include constructions of new examples, structure theorems, valency…

Combinatorics · Mathematics 2016-05-03 Xi-Ming Cheng , Alexander L. Gavrilyuk , Gary R. W. Greaves , Jack H. Koolen

Identities obtained by elementary finite Fourier analysis are used to derive a variety of evaluations of the Tutte polynomial of a graph G at certain points (a,b) where (a-1)(b-1) equals 2 or 4. These evaluations are expressed in terms of…

Combinatorics · Mathematics 2007-09-20 Andrew J. Goodall

In this paper, we investigate the number of induced subgraphs and subdigraphs of Paley graphs and Paley tournaments where the (out-)degree of each vertex has the same parity. For Paley graphs, we establish a lower bound for the number of…

Combinatorics · Mathematics 2025-12-23 Qilong Li , Yue Zhou

Every regular map on a closed surface gives rise to generally six regular maps, its "Petrie relatives", that are obtained through iteration of the duality and Petrie operations (taking duals and Petrie-duals). It is shown that the skeletal…

Combinatorics · Mathematics 2012-10-09 Anthony M. Cutler , Egon Schulte , Jorg M. Wills

A graph is called equimatchable if all of its maximal matchings have the same size. Due to Eiben and Kotrb\v{c}\'{i}k,, any connected graph with odd order and independence number $\alpha(G)$ at most $2$ is equimatchable. Akbari et al.…

Combinatorics · Mathematics 2025-09-15 Xiao Zhao , Haojie Zheng , Fengming Dong , Hengzhe Li , Yingbin Ma

This paper investigates the existence, enumeration and asymptotic performance of self-dual and LCD double circulant codes over Galois rings of characteristic $p^2$ and order $p^4$ with $p$ and odd prime. When $p \equiv 3 \pmod{4},$ we give…

Information Theory · Computer Science 2018-01-23 Minjia Shi , Daitao Huang , Lin Sok , Patrick Solé

Strongly regular Cayley graphs with Paley parameters over abelian groups of rank 2 were studied in [J.A Davis, Partial difference sets in p-groups, Arch.Math.63 (1994) 103-110; K.H Leung, S.L. Ma, Partial difference sets with Paley…

Combinatorics · Mathematics 2007-05-23 Yefim I. Leifman , Mikhail E. Muzychuk

We prove a conjecture of Dvo\v{r}\'ak, Kr\'al, Nejedl\'y, and \v{S}krekovski that planar graphs of girth at least five are square $(\Delta+2)$-colorable for large enough $\Delta$. In fact, we prove the stronger statement that such graphs…

Combinatorics · Mathematics 2019-11-18 Marthe Bonamy , Daniel W. Cranston , Luke Postle

We obtain normal forms for symmetric and for reversible polynomial automorphisms (polynomial maps that have polynomial inverses) of the plane. Our normal forms are based on the generalized \Henon normal form of Friedland and Milnor. We…

Chaotic Dynamics · Physics 2010-06-22 A. Gomez , J. D. Meiss