English
Related papers

Related papers: Genus of The Hypercube Graph And Real Moment-Angle…

200 papers

A cyclic subgroup graph of a group $G$ is a graph whose vertices are cyclic subgroups of $G$ and two distinct vertices $H_1$ and $H_2$ are adjacent if $H_1\leq H_2$, and there is no subgroup $K$ such that $H_1<K<H_2$. M.T\u{a}rn\u{a}uceanu…

Group Theory · Mathematics 2024-09-24 Khyati Sharma , A. Satyanarayana Reddy

In this paper we characterize the genera of those quotient curves $\mathcal{H}_q/G$ of the $\mathbb{F}_{q^2}$-maximal Hermitian curve $\mathcal{H}_q$ for which $G$ is contained in the maximal subgroup $\mathcal{M}_1$ of ${\rm…

Algebraic Geometry · Mathematics 2018-05-24 Francesca Dalla Volta , Maria Montanucci , Giovanni Zini

It is well known that the set of possible degree sequences for a graph on $n$ vertices is the intersection of a lattice and a convex polytope. We show that the set of possible degree sequences for a $k$-uniform hypergraph on $n$ vertices is…

Combinatorics · Mathematics 2012-01-31 Ricky Ini Liu

Let ${[n] \choose k}$ and ${[n] \choose l}$ $( k > l ) $ where $[n] = \{1,2,3,...,n\}$ denote the family of all $k$-element subsets and $l$-element subsets of $[n]$ respectively. Define a bipartite graph $G_{k,l} = ({[n] \choose k},{[n]…

Combinatorics · Mathematics 2019-11-26 Yeshwant Pandit , S. L. Sravanthi , Suresh Dara , S. M. Hegde

We analyze a random greedy process to construct $q$-uniform linear hypergraphs using the differential equation method. We show for $q=o(\sqrt{\log n})$, that this process yields a hypergraph with $\frac{n(n-1)}{q(q-1)}(1-o(1))$ edges. We…

Combinatorics · Mathematics 2024-12-18 Sayok Chakravarty , Nicholas Spanier

In this work we will construct bipartite graphs, famously known as Dessin d'enfant, corresponding to finite index subgroups of Hecke triangle groups $(2, q, \infty )$. Then using a results of \cite{ll} we shall show the correspondences…

Combinatorics · Mathematics 2023-07-19 Devendra Tiwari

In this work we consider constructions of genus three curves $X$ such that $\mathrm{End}(\mathrm{Jac} (X))\otimes Q$ contains the totally real cubic number field $Q(\zeta _7 +\bar{\zeta}_7 )$. We construct explicit three-dimensional…

Algebraic Geometry · Mathematics 2014-11-11 J. W. Hoffman , Dun Liang , Zhibin Liang , Ryotaro Okazaki , Yukiko Sakai , Haohao Wang

We give a sharp bound on the number of triangles in a graph with fixed number of edges. We also characterize graphs that achieve the maximum number of triangles. Using the upper bound on number of triangles, we prove that if $G$ is a…

Group Theory · Mathematics 2022-05-13 Tony N. Mavely , Viji Z. Thomas

In this paper we examine the classes of graphs whose $K_n$-complements are trees and quasi-threshold graphs and derive formulas for their number of spanning trees; for a subgraph $H$ of $K_n$, the $K_n$-complement of $H$ is the graph…

Discrete Mathematics · Computer Science 2007-05-23 Stavros D. Nikolopoulos , Charis Papadopoulos

Extremal problems concerning the number of complete subgraphs have a long story in extremal graph theory. Let $k_s(G)$ be the number of $s$-cliques in a graph $G$ and $m={{r_m}\choose s}+t_m$, where $0\le t_m\leq r_m$. Edr\H{o}s showed that…

Spectral Theory · Mathematics 2020-03-17 Longfei Fang , Mingqing Zhai , Bing Wang

In this paper, we study the high-order phase transition in random $r$-uniform hypergraphs. For a positive integer $n$ and a real $p\in [0,1]$, let $H:=H^r(n,p)$ be the random $r$-uniform hypergraph with vertex set $[n]$, where each $r$-set…

Combinatorics · Mathematics 2018-08-03 Linyuan Lu , Xing Peng

A classical extremal, or Tur\'an-type problem asks to determine ${\rm ex}(G, H)$, the largest number of edges in a subgraph of a graph $G$ which does not contain a subgraph isomorphic to $H$. Alon and Shikhelman introduced the so-called…

Combinatorics · Mathematics 2022-01-25 Maria Axenovich , Laurin Benz , David Offner , Casey Tompkins

For a group $G,$ the generating graph of $G,$ denoted by $\Gamma(G).$ We define $Q_n=\langle x,y: x^{2n}=y^4=1, x^n=y^2,y^{-1}xy=x^{-1}\rangle,$ the dicyclic group of order $4n.$ This paper primarily delves into exploring the graph…

Combinatorics · Mathematics 2026-02-23 Kavita Samant , A. Satyanarayana Reddy

The bouquet of circles $B_n$ and dipole graph $D_n$ are two important classes of graphs in topological graph theory. For $n\geq 1$, we give an explicit formula for the average genus $\gamma_{avg}(B_n)$ of $B_n$. By this expression, one…

Combinatorics · Mathematics 2019-09-02 Jinlian Zhang , Xuhui Peng , Yichao Chen

We study quantum automorphism groups of vertex-transitive graphs having less than 11 vertices. With one possible exception, these can be obtained from cyclic groups ${\mathbb Z}_n$, symmetric groups $S_n$ and quantum symmetric groups…

Quantum Algebra · Mathematics 2007-08-30 Teodor Banica , Julien Bichon

We give a complete description of the set of triples (a,b,c) of real numbers with the following property. There exists a constant K such that a n_3 + b n_2 + c n_1 - K is a lower bound for the matching number of every connected subcubic…

Combinatorics · Mathematics 2016-05-17 Penny Haxell , Alex Scott

The aim of this paper is to study the intersection hypergraph $\tilde{\Gamma}_\mathcal{H}(\mathbb{Z}_n)$ and co-maximal hypergraph $Co_\mathcal{H}(\mathbb{Z}_n)$ on the subgroups of $\mathbb{Z}_n$. We prove that the intersection and…

Combinatorics · Mathematics 2025-09-19 Sachin Ballal , Ardra A N

Let $K_{r_1,\ldots,r_s}$ denote the complete multipartite graph with class sizes $r_1,\ldots,r_s$ and let $K_s$ denote the complete graph of order $s$. In 2018, Luo determined the maximum number of $K_s$ in 2-connected graphs with a given…

Combinatorics · Mathematics 2022-02-22 Leilei Zhang

A graph product kernel means the kernel of the natural surjection from a graph product to the corresponding direct product. We prove that a graph product kernel of countable groups is special, and a graph product of finite or cyclic groups…

Group Theory · Mathematics 2012-05-17 Sang-hyun Kim

We show that for an infinitely many natural numbers $k$ there are $k$-uniform hypergraphs which admit a `rescaling phenomenon' as described in [9]. More precisely, let $\mathcal{A}(k,I, n)$ denote the class of $k$-graphs on $n$ vertices in…

Combinatorics · Mathematics 2018-07-09 Tomasz Łuczak , Joanna Polcyn , Christian Reiher
‹ Prev 1 3 4 5 6 7 10 Next ›