Embeddings of critical graphs near the Heawood bound
Fuente:
arXiv
Saved in:
| Main Author: | Sun, Timothy |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
The Heawood approach to Tait colorings and defining vertex sets
by: Lerner, E. Yu.
Published: (2024)
by: Lerner, E. Yu.
Published: (2024)
Improved bound on the number of edges of diameter-$k$-critical graphs
by: Wang, Xiaolin, et al.
Published: (2024)
by: Wang, Xiaolin, et al.
Published: (2024)
Genus embeddings of complete graphs minus a matching
by: Sun, Timothy
Published: (2024)
by: Sun, Timothy
Published: (2024)
Sampling and counting triangle-free graphs near the critical density
by: Jenssen, Matthew, et al.
Published: (2024)
by: Jenssen, Matthew, et al.
Published: (2024)
An optimal construction for complete graph embeddings with duals of low connectivity
by: Sun, Timothy
Published: (2024)
by: Sun, Timothy
Published: (2024)
Orientable triangular embeddings of the complete graphs on 36s vertices from noncyclic current graphs
by: Huynh, Avinh, et al.
Published: (2025)
by: Huynh, Avinh, et al.
Published: (2025)
Flow-critical graphs
by: Árnadóttir, Arnbjörg Soffía, et al.
Published: (2025)
by: Árnadóttir, Arnbjörg Soffía, et al.
Published: (2025)
An improved quasi-isometry between graphs of bounded cliquewidth and graphs of bounded treewidth
by: Distel, Marc
Published: (2025)
by: Distel, Marc
Published: (2025)
On asymptotically tight bound for the conflict-free chromatic index of nearly regular graphs
by: Kamyczura, Mateusz, et al.
Published: (2024)
by: Kamyczura, Mateusz, et al.
Published: (2024)
On strongly and robustly critical graphs
by: Bernshteyn, Anton, et al.
Published: (2024)
by: Bernshteyn, Anton, et al.
Published: (2024)
Connectivity of contraction-critical graphs
by: Lafferty, Michael, et al.
Published: (2025)
by: Lafferty, Michael, et al.
Published: (2025)
Extremal graphs for disjoint union of vertex-critical graphs
by: Zhang, Wenqian
Published: (2025)
by: Zhang, Wenqian
Published: (2025)
On asymptotically tight bounds for the open conflict-free chromatic indexes of nearly regular graphs
by: Kamyczura, Mateusz, et al.
Published: (2026)
by: Kamyczura, Mateusz, et al.
Published: (2026)
Size conditions and spectral conditions for generalized factor-critical (bicritical) graphs and $k$-$d$-critical graphs
by: Zhang, Zhenhao, et al.
Published: (2026)
by: Zhang, Zhenhao, et al.
Published: (2026)
A lower bound on the number of edges in DP-critical graphs
by: Bradshaw, Peter, et al.
Published: (2024)
by: Bradshaw, Peter, et al.
Published: (2024)
Orientations of graphs omitting non-edge-critical directed graphs
by: Sheats, Hannah
Published: (2025)
by: Sheats, Hannah
Published: (2025)
Spectral supersaturation for color-critical graphs
by: Fang, Longfei, et al.
Published: (2025)
by: Fang, Longfei, et al.
Published: (2025)
Spectral conditions for factor-criticality of graphs
by: Cai, Jin, et al.
Published: (2024)
by: Cai, Jin, et al.
Published: (2024)
$S$-packing chromatic vertex-critical graphs
by: Holub, Přemysl, et al.
Published: (2020)
by: Holub, Přemysl, et al.
Published: (2020)
Distance-critical and distance-redundant graphs
by: Steane, Andrew
Published: (2024)
by: Steane, Andrew
Published: (2024)
An alternative characterisation of graphs quasi-isometric to graphs of bounded treewidth
by: Distel, Marc
Published: (2025)
by: Distel, Marc
Published: (2025)
Star observations in bounded-degree graphs
by: Szegedy, Balazs
Published: (2026)
by: Szegedy, Balazs
Published: (2026)
Unified bounds for the independence number of graphs
by: Zhou, Jiang
Published: (2024)
by: Zhou, Jiang
Published: (2024)
Complexes of graphs with bounded independence number
by: Kim, Minki, et al.
Published: (2019)
by: Kim, Minki, et al.
Published: (2019)
Dirac's theorem for graphs of bounded bandwidth
by: Díaz, Alberto Espuny, et al.
Published: (2024)
by: Díaz, Alberto Espuny, et al.
Published: (2024)
Upper bounds of Steklov eigenvalues on graphs
by: Lin, Huiqiu, et al.
Published: (2024)
by: Lin, Huiqiu, et al.
Published: (2024)
Upper bounds for linear graph codes
by: Versteegen, Leo
Published: (2023)
by: Versteegen, Leo
Published: (2023)
On the extreme complexity of certain nearly regular graphs
by: Constantine, Gregory P, et al.
Published: (2025)
by: Constantine, Gregory P, et al.
Published: (2025)
On the multicolor Turán conjecture for color-critical graphs
by: Li, Xihe, et al.
Published: (2024)
by: Li, Xihe, et al.
Published: (2024)
On minimal k-factor-critical planar graphs
by: Li, Qiuli, et al.
Published: (2025)
by: Li, Qiuli, et al.
Published: (2025)
Maker-Breaker domination game critical graphs
by: Divakaran, Athira, et al.
Published: (2024)
by: Divakaran, Athira, et al.
Published: (2024)
On near optimal colorable graphs
by: Angeliya, C. U., et al.
Published: (2025)
by: Angeliya, C. U., et al.
Published: (2025)
List packing of graphs with bounded tree-width
by: Kashima, Masaki, et al.
Published: (2026)
by: Kashima, Masaki, et al.
Published: (2026)
The Ferrers bound for spanning trees in bipartite graphs
by: Ho, Boon Suan
Published: (2026)
by: Ho, Boon Suan
Published: (2026)
Unified bounds for the independence number of graph powers
by: Abiad, Aida, et al.
Published: (2024)
by: Abiad, Aida, et al.
Published: (2024)
On $k$-coalition in graphs: bounds and exact values
by: Brešar, Boštjan, et al.
Published: (2025)
by: Brešar, Boštjan, et al.
Published: (2025)
Optimal $χ$-boundness of $\ell$-holed graphs
by: Wang, Yan, et al.
Published: (2025)
by: Wang, Yan, et al.
Published: (2025)
Sums along the edges of bounded degree graphs
by: Alon, Noga, et al.
Published: (2025)
by: Alon, Noga, et al.
Published: (2025)
Strengthened upper bound on the third eigenvalue of graphs
by: Li, Sida
Published: (2025)
by: Li, Sida
Published: (2025)
Graphs that are quasi-isometric to graphs with bounded treewidth
by: Hickingbotham, Robert
Published: (2025)
by: Hickingbotham, Robert
Published: (2025)
Similar Items
-
The Heawood approach to Tait colorings and defining vertex sets
by: Lerner, E. Yu.
Published: (2024) -
Improved bound on the number of edges of diameter-$k$-critical graphs
by: Wang, Xiaolin, et al.
Published: (2024) -
Genus embeddings of complete graphs minus a matching
by: Sun, Timothy
Published: (2024) -
Sampling and counting triangle-free graphs near the critical density
by: Jenssen, Matthew, et al.
Published: (2024) -
An optimal construction for complete graph embeddings with duals of low connectivity
by: Sun, Timothy
Published: (2024)