:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Savery, Michael
Formato:	Preprint
Publicado:	2021
Materias:	Combinatorics
Acceso en línea:	https://arxiv.org/abs/2110.07319
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Invertibility of digraphs and tournaments
por: Alon, Noga, et al.
Publicado: (2022)

Game Connectivity and Adaptive Dynamics
por: Johnston, Tom, et al.
Publicado: (2023)

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

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

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

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

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

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

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

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

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

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