:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Savery, Michael
Format:	Preprint
Published:	2021
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2110.07319
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Planar cycle-extendable graphs
by: Dalwadi, Aditya Y, et al.
Published: (2024)

Planar Turán number of two adjacent cycles
by: Song, Xinzhe, et al.
Published: (2024)

The maximum number of maximum dissociation sets in potted graphs
by: Huang, Zejun, et al.
Published: (2024)

The maximum number of cliques in disjoint copies of graphs
by: Gao, Zhipeng, et al.
Published: (2025)

Planar graphs with distance of 3-cycles at least 2 and no cycles of lengths 5, 6, 7
by: Wang, Tao, et al.
Published: (2025)

Maximal 1-plane graphs with the maximum number of crossings
by: Ouyang, Zhangdong, et al.
Published: (2025)

Maximal and maximum induced matchings in connected graphs
by: Yuan, Bo-Jun, et al.
Published: (2024)

Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
by: Chakraborty, Dipayan, et al.
Published: (2024)

Ramsey numbers of cycles in random graphs
by: Araújo, Pedro, et al.
Published: (2022)

Improved bounds for 1-independent percolation on $\mathbb{Z}^n$
by: Balister, Paul, et al.
Published: (2022)

The maximum number of cliques in graphs with given fractional matching number and minimum degree
by: Li, Chengli, et al.
Published: (2024)

The maximum number of triangles in graphs without the square of a path
by: Wang, Yichen, et al.
Published: (2026)

On graphs with chromatic number and maximum degree both equal to nine
by: Galindo, Rachel, et al.
Published: (2024)

The Planar Turán Number of $Θ_6$-graphs
by: Guan, David, et al.
Published: (2024)

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
by: Bonamy, Marthe, et al.
Published: (2022)

On graphs with maximum difference between game chromatic number and chromatic number
by: Hollom, Lawrence
Published: (2023)

Calculating the maximum number of maximum cliques for simple graphs
by: Pfeifer, Dániel
Published: (2023)

The maximum number of $k$-cliques of 7-connected 1-planar graphs
by: Huang, Yuanqiu, et al.
Published: (2026)

Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles
by: Liu, Zhengjiao, et al.
Published: (2025)

The maximum number of triangles in graphs without vertex disjoint friendship graphs
by: Chen, Wanfang, et al.
Published: (2026)

The maximum number of triangles in $K_{1,s,t}$-free graphs
by: Calbet, Asier, et al.
Published: (2025)

Connected cubic graphs with the maximum number of perfect matchings
by: Horak, Peter, et al.
Published: (2020)

On the maximum degree of induced subgraphs of the Kneser graph
by: Chau, Hou Tin, et al.
Published: (2023)

The generalized Tur'{a}n number of long cycles in graphs and bipartite graphs
by: Dong, Changchang, et al.
Published: (2024)

Planar graphs having no cycle of length $4$, $6$ or $8$ are DP-3-colorable
by: Jin, Ligang, et al.
Published: (2024)

Concentration of the maximum size of an induced subtree in moderately sparse random graphs
by: Oropeza, Juan Carlos Buitrago
Published: (2025)

The maximum index of signed complete graphs whose negative edges induce a bicyclic graph
by: Fang, Ziyi, et al.
Published: (2024)

On the maximum number of common neighbours in dense random regular graphs
by: Isaev, Mikhail, et al.
Published: (2023)

Invertibility of digraphs and tournaments
by: Alon, Noga, et al.
Published: (2022)

Game Connectivity and Adaptive Dynamics
by: Johnston, Tom, et al.
Published: (2023)

Game connectivity and adaptive dynamics in many-action games
by: Johnston, Tom, et al.
Published: (2026)

Relaxation of Wegner's Planar Graph Conjecture for maximum degree 4
by: Cho, Eun-Kyung, et al.
Published: (2022)

Planar graphs without cycles of length 4 or 5 are $(7m:2m)$-DP-colorable
by: Xu, Xiaoyan, et al.
Published: (2025)

Excluded conformal minors of Birkhoff-von Neumann graphs with equal global forcing number and maximum anti-forcing number
by: Zhang, Yaxian, et al.
Published: (2025)

Odd and even cycle lengths, minimum degree and chromatic number in graphs
by: Wang, Xiaolin
Published: (2025)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
by: Botler, Fábio, et al.
Published: (2025)

Planar Turán numbers of three configurations
by: Bai, Xuqing, et al.
Published: (2025)

Turán numbers of cycles plus a general graph
by: Dou, Chunyang, et al.
Published: (2024)

The number of induced paths in outerplanar graphs
by: Wang, Yichen, et al.
Published: (2026)

Planar induced paths via a decomposition into non-crossing ordered graphs
by: Duron, Julien, et al.
Published: (2025)