Publication:4401944
From MaRDI portal
zbMath0277.05002MaRDI QIDQ4401944
A. Bekessy, János Komlós, P. Bekessy
Publication date: 1973
05A15: Exact enumeration problems, generating functions
05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)
05C30: Enumeration in graph theory
Related Items
Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy, Configuring Random Graph Models with Fixed Degree Sequences, Optimal phase synchronization in networks of phase-coherent chaotic oscillators, Uniform Generation of Random Regular Graphs, On combinatorial rectangles with minimum ∞−discrepancy, Phase transition in random contingency tables with non-uniform margins, Exactly solvable random graph ensemble with extensively many short cycles, Fast uniform generation of random graphs with given degree sequences, Asymptotic enumeration of digraphs and bipartite graphs by degree sequence, On the number of contingency tables and the independence heuristic, Edge removal in random contact networks and the basic reproduction number, Model for disease dynamics of a waterborne pathogen on a random network, Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums, Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums, The asymptotic distribution of short cycles in random regular graphs, Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums, Counting connected graphs inside-out, Metric structure of random networks, Effective degree household network disease model, How big is too big? Critical shocks for systemic failure cascades, Efficient importance sampling for binary contingency tables, Synchronization of Heterogeneous Oscillators Under Network Modifications: Perturbation and Optimization of the Synchrony Alignment Function, The Number of Satisfying Assignments of Random Regulark-SAT Formulas
