Kombinatorische Anzahlbestimmungen in Relationen

DOI10.1007/BF01363123zbMath0155.35002OpenAlexW1995916222MaRDI QIDQ2526763

Walter Oberschelp

Publication date: 1967

Published in: Mathematische Annalen (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/161625

zbMATH Keywords

set theory

Related Items (20)

Counting unlabeled structures ⋮ Asymptotic formulas for the number of self‐complementary graphs and digraphs ⋮ Enumerating graphs via even/odd dichotomy ⋮ A network experiment in continuous time: The influence of link costs ⋮ The number of unlabelled graphs with many nodes and edges ⋮ Lights Out On A Random Graph ⋮ The functorial composition of species, a forgotten operation ⋮ Asymptotic formulas for the number of oriented graphs ⋮ The Probability of Connectedness of an Unlabelled Graph Can Be Less for More Edges ⋮ Enumeration of self-complementary structures ⋮ Streng parametrische Bedingungen und die Anzahl ihrer nicht isomorphen Modelle ⋮ Burnside's lemma: A historical note ⋮ The number of graphs on many unlabelled nodes ⋮ Die Anzahl nicht-isomorpher \(m\)-Graphen ⋮ Graphs on unlabelled nodes with a given number of edges ⋮ The number of strongly connected directed graphs ⋮ On the number of \(n\)-plexes ⋮ Asymptotische Abschätzung einer Anzahlfunktion in endlichen Relationssystemen ⋮ On the enumeration of self-complementary m-placed relations ⋮ The size distribution for Markov equivalence classes of acyclic digraph models.

Cites Work

• Note on an enumeration theorem of Davis and Slepian
• Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I
• On generalized graphs
• The Number of Structures of Finite Relations
• On The Number of Symmetry Types of Boolean Functions of n Variables
• The Number of Linear, Directed, Rooted, and Connected Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Kombinatorische Anzahlbestimmungen in Relationen