Imagen de Portada

The maximum number of $k$-cliques of 7-connected 1-planar graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Huang, Yuanqiu, Zhang, Licheng
Formato:	Preprint
Publicado:	2026
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Extremal 1-planar graphs without k-cliques
por: Zhang, Licheng, et al.
Publicado: (2026)

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

4-connected 1-planar chordal graphs are Hamiltonian-connected
por: Zhang, Licheng, et al.
Publicado: (2024)

Two classes of connectivity-related non-Hamiltonian 1-planar perfect graphs
por: Zhang, Licheng, et al.
Publicado: (2024)

The sharp upper bounds on the maximum degree and vertex-connectivity of claw-free 1-planar graphs
por: Zhang, Licheng, et al.
Publicado: (2025)

Near-perfect matchings in highly connected 1-planar graphs with a local crossing constraint
por: Ouyang, Licheng Zhang Yuanqiu Huang Zhangdong
Publicado: (2026)

The reducibility of optimal 1-planar graphs
por: Zhang, Licheng, et al.
Publicado: (2022)

A note on optimal 2-planar graphs
por: Zhang, Licheng, et al.
Publicado: (2025)

The minimum size of 2-connected chordal bipartite graphs
por: Zhang, Licheng, et al.
Publicado: (2024)

The minimum crossing number and minimum size of maximal 1-plane graphs with given connectivity
por: Ouyang, Zhangdong, et al.
Publicado: (2025)

The minimum size of maximal bipartite IC-plane graphs with given connectivity
por: Wang, Guiping, et al.
Publicado: (2025)

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

The generalized 4-connectivity of godan graphs
por: Wang, Jing, et al.
Publicado: (2024)

Determining the minimum size of maximal 1-plane graphs
por: Huang, Yuanqiu, et al.
Publicado: (2025)

Dense $2$-connected planar graphs and the planar Turán number of $2C_k$
por: Li, Ping
Publicado: (2025)

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

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

On the maximum number of edges of outer k-planar graphs
por: Pfister, Maximilian
Publicado: (2025)

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

Packing independent cliques into planar graphs
por: Biró, Csaba, et al.
Publicado: (2024)

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

The number of cut-edges and conflict-free connection number in planar graphs
por: Ha, Pham Hoang, et al.
Publicado: (2026)

A note on the maximum ratio between chromatic number and clique number
por: Araujo, Igor, et al.
Publicado: (2025)

On the maximum number of $r$-cliques in graphs free of complete $r$-partite subgraphs
por: Balogh, József, et al.
Publicado: (2024)

On the $4$-clique cover number of graphs
por: Chen, Yihan, et al.
Publicado: (2025)

On the clique covering numbers of Johnson graphs
por: Jørgensen, Søren Fuglede
Publicado: (2025)

The generalized 3-connectivity of a family regular networks
por: Wang, Jing, et al.
Publicado: (2022)

Ordered Yao graphs: maximum degree, edge numbers, and clique numbers
por: Ágoston, Péter, et al.
Publicado: (2025)

Odd clique minors in graphs with independence number two
por: Ji, Yuqing, et al.
Publicado: (2025)

Extremal number of cliques of given orders in graphs with a forbidden clique minor
por: Shi, Ruilin, et al.
Publicado: (2024)

On the maximum spectral radius of planar graphs
por: Yu, Guanglong, et al.
Publicado: (2025)

Nordhaus-Gaddum inequalities for the number of cliques in a graph
por: Bal, Deepak, et al.
Publicado: (2024)

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
por: Dailly, Antoine, et al.
Publicado: (2025)

A new infinite family of 4-regular crossing-critical graphs
por: Ding, Zongpeng, et al.
Publicado: (2024)

The independence and clique cover numbers of the squarefree graph
por: Alexeev, Boris, et al.
Publicado: (2025)

On minimal k-factor-critical planar graphs
por: Li, Qiuli, et al.
Publicado: (2025)

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
por: Bastida, Sam, et al.
Publicado: (2026)

Coloring graphs with independence number two and no odd clique immersions
por: Echeverría, Henry, et al.
Publicado: (2026)

The circumference of a graph with given minimum degree and clique number
por: Chen, Na, et al.
Publicado: (2025)

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
por: Chudnovsky, Maria, et al.
Publicado: (2024)