Counting sparse \(k\)-edge-connected hypergraphs with given number of vertices and edges

DOI10.1016/j.entcs.2019.08.047OpenAlexW2978610504WikidataQ113317384 ScholiaQ113317384MaRDI QIDQ2132389

Guilherme Oliveira Mota, Cristiane M. Sato, Carlos Hoppen, Roberto F. Parente

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.047

zbMATH Keywords

enumerationconnectivityhypergraphsprobabilistic method

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using Lovász local lemma in the space of random injections
• Counting connected graphs inside-out
• Asymptotic enumeration of sparse graphs with a minimum degree constraint
• Asymptotic enumeration of sparse 2-connected graphs
• Complex martingales and asymptotic enumeration
• Counting dense connected hypergraphs via the probabilistic method
• Counting Connected Hypergraphs via the Probabilistic Method
• The Asymptotic Number of Connectedd-Uniform Hypergraphs
• Counting connected graphs and hypergraphs via the probabilistic method

This page was built for publication: Counting sparse \(k\)-edge-connected hypergraphs with given number of vertices and edges