On a certain numbering of the vertices of a hypergraph

DOI10.21136/CMJ.1983.101849MaRDI QIDQ3669457zbMATH OpenOpenAlexFDO

Authors Ladislav Nebeský

Publication date 1983

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

zbMATH Keywords

projectoidprojectoidic arrangementsubsets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Directed graphs (digraphs), tournaments (05C20) Hypergraphs (05C65)

Cites work

• A structure theorem for the consecutive 1's property
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• Faithful Representation of a Family of Sets by a Set of Intervals
• scientific article; zbMATH DE number 3312524 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• Incidence matrices and interval graphs

Cited in

(2)

• Transit functions and pyramid-like binary clustering systems
• Transit functions and clustering systems

This page was built for publication: On a certain numbering of the vertices of a hypergraph

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