GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics
The research of the group focuses on interrelated aspects of combinatorics: Graph theory, Random Graphs, Probabilistic method, Geometric group theory and algebraic methods, Enumerative combinatorics, Combinatorial geometry, and Combinatorial number theory. Some recent research achievements are: Proof of the Maximum Distance Separable codes conjecture for prime fields; solution of a conjecture of Green on the removal lemma for systems of equations in finite fields
Restricted access - publisher's policyWe provide precise asymptotic estimates for the number of several classes of labeled cubic planar graphs, and we analyze properties of such random graphs under the uniform distribution. This model was first analyzed by ...
(Institute of Electrical and Electronics Engineers (IEEE), 2016)
Open AccessThe traditional Erdos-Renyi model of a random network is of little use in modelling the type of complex networks which modern researchers study. In this graph, every pair of vertices is equally likely to be connected by ...
Open AccessThe goal of this paper is to obtain quantitative results on the number and on the size of maximal independent sets and maximal matchings in several block-stable graph classes that satisfy a proper sub-criticality condition. ...
Open AccessThe classical result by Dyer–Scott about fixed subgroups of finite order automor-phisms of Fnbeing free factors of Fn is no longer true inZm×Fn. Within this more generalcontext, we prove a relaxed version in the spirit of ...