Generating functions of some families of directed uniform hypergraphs

zbMATH Open1447.05149arXiv2005.11677MaRDI QIDQ2199871FDOQ2199871

Rasendrahasina Vonjy, Ravelomanana Vlady

Publication date: 14 September 2020

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Abstract: In this paper, we count acyclic and strongly connected uniform directed labeled hypergraphs. For these combinatorial structures, we introduce a specific generating function allowing us to recover and generalize some results on the number of directed acyclic graphs and the number of strongly connected directed graphs.

Full work available at URL: https://arxiv.org/abs/2005.11677

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Mathematical Foundations of Computer Science 2005
• scientific article; zbMATH DE number 3977044
• Enumeration of unlabeled directed hypergraphs
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• On the degree sequences of uniform hypergraphs
• A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs
• Enumeration of unlabeled uniform hypergraphs
• The counting of uniform acyclic hypergraphs
• The \(Q\)-generating function for graphs with application
• The \(\alpha\)-normal labeling for generalized directed uniform hypergraphs

zbMATH Keywords

generating functionsacyclic digraphsdirected labeled hypergraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Paths and cycles (05C38) Connectivity (05C40) Hypergraphs (05C65) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Analytic combinatorics
• Directed hypergraphs and applications
• Acyclic orientations of graphs
• Title not available (Why is that?)
• The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Enumerative applications of a decomposition for graphs and digraphs
• The transitive closure of a random digraph
• Title not available (Why is that?)
• The asymptotic number of acyclic digraphs. I
• Counting acyclic digraphs by sources and sinks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Directed recursive labelnode hypergraphs: A new representation-language
• Directed hypergraphs: introduction and fundamental algorithms -- a survey
• The critical behavior of random digraphs
• The Number of k-Coloured Graphs on Labelled Nodes
• Generalized AND/OR graphs
• Title not available (Why is that?)
• Enumeration and structure of inhomogeneous graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• On the number of labeled acyclic digraphs
• Generating functions for directed animals convex following their direction
• The counting series for unlabeled linear acyclic hypergraphs.
• The birth of the strong components

This page was built for publication: Generating functions of some families of directed uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199871)