Tamás Héger
Eötvös Loránd University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Tamás Héger.
Discrete Mathematics | 2010
Gabriela Araujo-Pardo; Tamás Héger
Small k-regular graphs of girth g where g=6,8,12 are obtained as subgraphs of minimal cages. More precisely, we obtain (k,6)-graphs on 2(kq-1) vertices, (k,8)-graphs on 2k(q^2-1) vertices and (k,12)-graphs on 2kq^2(q^2-1), where q is a prime power and k is a positive integer such that q>=k>=3. Some of these graphs have the smallest number of vertices known so far among the regular graphs with girth g=6,8,12.
Designs, Codes and Cryptography | 2015
Tamás Héger; Balázs Patkós; Marcella Takáts
We consider the following
Journal of Combinatorial Designs | 2017
Tamás Héger; Zoltán Lóránt Nagy
Contributions to Discrete Mathematics | 2008
András Gács; Tamás Héger
q
Electronic Journal of Combinatorics | 2012
Tamás Héger; Marcella Takáts
Archive | 2013
Gábor Damásdi; Tamás Héger; Tamás Szőnyi
q-analog of the basic combinatorial search problem: let
Journal of Combinatorial Designs | 2013
Gábor Bacsó; Tamás Héger; Tamás Szőnyi
Finite Fields and Their Applications | 2010
András Gács; Tamás Héger; Zoltán Lóránt Nagy; Dömötör Pálvölgyi
q
Electronic Journal of Combinatorics | 2016
Jan De Beule; Tamás Héger; Tamás Szőnyi; Geertrui Van de Voorde
European Journal of Combinatorics | 2013
András Gács; Tamás Héger; Zsuzsa Weiner
q be a prime power and
