Generating functions of some families of directed uniform hypergraphs

zbMath1447.05149arXiv2005.11677MaRDI QIDQ2199871

Rasendrahasina Vonjy, Ravelomanana Vlady

Publication date: 14 September 2020

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

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

zbMATH Keywords

generating functionsacyclic digraphsdirected labeled hypergraphs

Mathematics Subject Classification ID

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

Related Items (1)

The birth of the strong components

Cites Work

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

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