activity
20072021
most citedIndecomposable coverings with homothetic polygons

5 citations · 13 across the 10 of their papers we have counts for

collaborators

17 papers

math.GR2021

On finite groups with prescribed two-generator subgroups and integral Cayley graphs

Yan-Quan Feng, István Kovács

In this paper, we characterize the finite groups of even order with the property that for any involution and element of , is isomorphic to one…

math.CO2018

Inherited conics in Hall planes

Aart Blokhuis, István Kovács, Gábor P. Nagy +1

The existence of ovals and hyperovals is an old question in the theory of non-Desarguesian planes. The aim of this paper is to describe when a conic of remains an a…

math.CO2017

On k-neighbor separated permutations

István Kovács, Daniel Soltész

Two permutations of are \textit{-neighbor separated} if there are two elements that are neighbors in one of the permutations and that are separated by exa…

math.CO2017

On groups all of whose Haar graphs are Cayley graphs

Yan-Quan Feng, Istvan Kovacs, Da-Wei Yang

A Cayley graph of a group is a finite simple graph such that contains a subgroup isomorphic to acting regularly on , while a Haar graph of is a…

math.CO2017

Elementary abelian groups of rank 5 are DCI-groups

Yan-Quan Feng, István Kovács

In this paper, we show that the group is a DCI-group for any odd prime that is, two Cayley digraphs Cay and Cay are is…

cs.DM2017★ 4 cited

The complexity of recognizing minimally tough graphs

Gyula Y Katona, István Kovács, Kitti Varga

A graph is called -tough if the removal of any vertex set that disconnects the graph leaves at most components. The toughness of a graph is the largest for which…