Enumeration of unlabeled uniform hypergraphs

DOI10.1016/j.disc.2014.03.005zbMath1288.05128OpenAlexW2074363294MaRDI QIDQ2449157

Jian Guo Qian

Publication date: 6 May 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.03.005

zbMATH Keywords

enumerationuniform hypergraphunlabeled hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Enumeration in graph theory (05C30)

Related Items (3)

Combinatorial reductions for the Stanley depth of \(I\) and \(S/I\) ⋮ On vertex independence number of uniform hypergraphs ⋮ Numerical Algorithm for Pólya Enumeration Theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian cycle problem and Markov chains.
• On the number of bi-colored graphs
• Enumeration of unlabelled bicolored graphs by degree parities
• Cyclic partitions of complete uniform hypergraphs
• Asymptotic enumeration and limit laws for graphs of fixed genus
• Asymptotic enumeration and limit laws of planar graphs
• Enumeration of graphs with signed points and lines
• Counting cubic graphs
• On the Number of Classes of Binary Matrices
• Counting Claw-Free Cubic Graphs
• Enumeration of Graphs with Given Partition
• Enumeration of hypergraphs. I
• Enumeration of hypergraphs

This page was built for publication: Enumeration of unlabeled uniform hypergraphs