27 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University of ZurichCH4 papers
- University of WashingtonUS3 papers
- Vrije Universiteit BrusselBE3 papers
- Ghent UniversityBE2 papers
- Harvard UniversityUS2 papers
- Hungarian Academy of SciencesHU2 papers
- HUN-REN Alfréd Rényi Institute of MathematicsHU2 papers
- University of BergenNO2 papers
- University of PannoniaHU2 papers
- Alibaba Group (China)CN1 paper
- Cardiff UniversityGB1 paper
- Central Washington UniversityUS1 paper
Showing math.COShow all
3 papers · 1 filter
math.CO2020★ 1 cited
Connected cubic graphs with the maximum number of perfect matchings
Peter Horak, Dongryul Kim
It is proved that for , the number of perfect matchings in a simple connected cubic graph on vertices is at most , with being the -th Fibonacci n…
math.CO2016★ 3 cited
Algebraic Method in Tilings
Peter Horak, Dongryul Kim
In this paper we introduce a new algebraic method in tilings. Combining this method with Hilbert's Nullstellensatz we obtain a necessary condition for tiling -space by translate…
math.CO2015
A Combinatorial Problem Related to Sparse Systems of Equations
Peter Horak, Igor Semaev, Zsolt Tuza
Nowadays sparse systems of equations occur frequently in science and engineering. In this contribution we deal with sparse systems common in cryptanalysis. Given a cipher system, o…