Probabilistic models for the analysis of inverse extremal problems in combinatorics

In an inverse extremal problem for a combinatorial scheme with a given value of the objective function of the form of a certain extreme value of its characteristic, a probabilistic model is developed that ensures that this value is obtained in its outcomes. Two types of such characteristics are considered, relating to each of the schemes or to a set of outcomes.
The pre-asymptotic analysis of such a model is carried out by the author's enumerative method. It is based on the construction of an iterative random process with iterations of successive stages of a numbered non-repetitive enumeration and the formation of outcomes of the scheme. The iterative development of the process is represented by a probabilistic graph.
The study of the outcomes of the scheme according to the model in the enumerative method is carried out in the following areas: visual numbering of the outcomes of the scheme, finding their number, establishing a one-to-one correspondence between the types and numbers of outcomes of the scheme, obtaining their probabilistic distribution (controlled by a random process of listing the outcomes of the scheme), and modeling them with this distribution.
Along with the direct study of circuits in these areas, algorithms are proposed to obtain results for them by partially recalculating them from the results of a similar analysis of more general, previously studied circuits without restrictions or with less restrictions on the values of the characteristics under consideration.