Exploració per tema "Configuracions i dissenys combinatòrics"
Ara es mostren els items 1-3 de 3
-
Irreducibility of the Tutte polynomial of an embedded graph
(2022-12-19)
Article
Accés obertWe prove that the ribbon graph polynomial of a graph embedded in an orientable surface is irreducible if and only if the embedded graph is neither the disjoint union nor the join of embedded graphs. This result is analogous ... -
Normal limiting distributions for systems of linear equations in random sets
(Elsevier, 2022-09-15)
Article
Accés obertWe consider the binomial random set model where each element in is chosen independently with probability . We show that for essentially all regimes of p and very general conditions for a matrix A and a column vector b, the ... -
The Maximum degree of series-parallel graphs
(2011-07)
Article
Accés restringit per acord de confidencialitatWe prove that the maximum degree Δn of a random series-parallel graph with n vertices satisfies Δn/ log n → c in probability, and EΔn ∼ c log n for a computable constant c > 0. The same kind of result holds for 2-connected ...