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

1-Planar graphs without 5-cycles or adjacent triangles have at most 3n − 6 edges

View Full Paper
Ask AI
Bookmark
Share

Authors

MDMengyao DaiXZXin Zhang

Discussion

Loading...

Member takes

Overview

Key Points

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

Cite This Study

Dai et al. (2026) studied this question.

synapsesocial.com/papers/6ab61039406bf401c14698dfhttps://doi.org/10.1016/j.disc.2026.115440
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. 1The 4‐degeneracy of Planar Graphs2026
  2. 2The Extremal Number of Cycles with All Diagonals2024 · 4 citations
  3. 3Counting $k$-cycles in $5$-connected planar triangulations2025
  4. 4Weak Degeneracy of Planar Graphs2024
  5. 5Edge-disjoint cycles with the same vertex set2024