Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
September 17, 2026Discrete MathematicsOpen Access

Describing edges in triangle-free 3-polytopes

View Full Paper
Ask AI
Bookmark
Share

Authors

OBO.V. BorodinAIA. O. Ivanova

Discussion

Loading...

Member takes

Overview

Key Points

Key points are not available for this paper at this time.

Cite This Study

Borodin et al. (2026) studied this question.

synapsesocial.com/papers/6aabb7155f706d05830e5d89https://doi.org/10.1016/j.disc.2026.115428
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Polytopes with low excess degree2024
  2. 2Triangle-free triple systems2024
  3. 3The Erdős–Sauer Clique Decomposition Problem for 3-Graphs: Verification through Nine Vertices and Local Packing Reductions2026
  4. 4The Erdős–Sauer Clique Decomposition Problem for 3-Graphs: Verification through Nine Vertices and Local Packing Reductions2026
  5. 5A refined lower bound theorem for <i>d</i> -polytopes with at most 2 <i>d</i> vertices2026