2023
DOI: 10.1016/j.dam.2022.11.015
|View full text |Cite
|
Sign up to set email alerts
|

Facets and facet subgraphs of symmetric edge polytopes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…Given a facet-defining function f as in Theorem 2.1, we write G f for the corresponding facet subgraph, i.e., the subgraph with vertex set V and edge set E f . Lemma 2.3 (Chen, Davis, Korchevskaia (6)). Let G be a connected graph.…”
Section: Facets Of G(n P)mentioning
confidence: 99%
See 1 more Smart Citation
“…Given a facet-defining function f as in Theorem 2.1, we write G f for the corresponding facet subgraph, i.e., the subgraph with vertex set V and edge set E f . Lemma 2.3 (Chen, Davis, Korchevskaia (6)). Let G be a connected graph.…”
Section: Facets Of G(n P)mentioning
confidence: 99%
“…Symmetric edge polytopes, also called type PV adjacency polytopes, have been the subject of extensive recent study (2,6,7,8,9,10,14,15,16,17,18,20,21,22). One problem of interest is to establish relationships between the combinatorial structure of G and geometric properties of P G , motivated by applications in both pure and applied contexts.…”
Section: Introductionmentioning
confidence: 99%