Graphical partially ordered sets (Q1104937)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4057552
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphical partially ordered sets |
scientific article; zbMATH DE number 4057552 |
Statements
Graphical partially ordered sets (English)
0 references
1987
0 references
The main results of this paper can be found in a generalization of reconstruction properties to a large class of combinatorial structures by a concept of g-graph. For example in the section 3, the author shows many results about the reconstruction conjecture: many of them are known for graphs, but author's proof generalizes them for digraphs, hypergraphs, etc... In the concluding section the author lists some open problems.
0 references
reconstruction properties
0 references
g-graph
0 references
reconstruction conjecture
0 references
0.7867700457572937
0 references
0.7751581072807312
0 references
0.7750148177146912
0 references
