The structure and number of global roundings of a graph (Q1884844)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The structure and number of global roundings of a graph |
scientific article; zbMATH DE number 2110951
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The structure and number of global roundings of a graph |
scientific article; zbMATH DE number 2110951 |
Statements
The structure and number of global roundings of a graph (English)
0 references
27 October 2004
0 references
Let \(P= (U;E)\) be a connected labelled graph. This article considers the hypergraph \(H_G= (V,{\mathcal P}_G)\), where \(V\) is the set of vertices of \(P\). From this constructions and after the definition of discrepancy, the article deals with the maximum number of integral points in an open unit ball, using the discrepancy distance. The authors introduce some conjectures on this number, and they give some graphs for which these conjectures hold.
0 references
Combinatorics
0 references
Rounding
0 references
Discrepancy
0 references
Graph
0 references
Hypergraph
0 references
0 references
0 references
