Imagen de Portada

On cliques in hypergraphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Gao, Jun
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The number of cliques in hypergraphs with forbidden subgraphs
por: Basu, Ayush, et al.
Publicado: (2024)

Counting cliques without generalized theta graphs
por: Gao, Jun, et al.
Publicado: (2023)

Generalized Ramsey--Turán density for cliques
por: Gao, Jun, et al.
Publicado: (2024)

Rational codegree Turán density of hypergraphs
por: Gao, Jun, et al.
Publicado: (2026)

Piercing all maximum cliques in hypergraphs
por: Holmsen, Andreas, et al.
Publicado: (2026)

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

Solution to a problem on isolation of cliques in uniform hypergraphs
por: Borg, Peter
Publicado: (2025)

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

Turán density of cliques of order five in $3$-uniform hypergraphs with quasirandom links
por: Berger, Sören, et al.
Publicado: (2022)

Topological cliques in sparse expanders
por: Wang, Xia, et al.
Publicado: (2024)

Covering a supermodular-like function in a mixed hypergraph
por: Gao, Hui
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)

On the Ramsey-Turán problem for 4-cliques
por: Csaba, Béla
Publicado: (2025)

Anti-Ramsey number of intersecting cliques
por: Lu, Hongliang, et al.
Publicado: (2025)

Packing edge disjoint cliques in graphs
por: Balogh, József, et al.
Publicado: (2025)

Counting cliques with prescribed intersection sizes
por: Zhao, Yuhao, et al.
Publicado: (2025)

Antimagicness of graphs with a dominating clique
por: Beaudoire, Grégoire, et al.
Publicado: (2025)

Spanning clique subdivisions in pseudorandom graphs
por: Lee, Hyunwoo, et al.
Publicado: (2025)

Weak saturation of tensor product of cliques
por: Terekhov, Nikolai
Publicado: (2026)

Clique covers and decompositions of cliques of graphs
por: Balogh, József, et al.
Publicado: (2024)

Many cliques with small degree powers
por: Chao, Ting-Wei, et al.
Publicado: (2024)

Embedding clique subdivisions via crux
por: Yang, Donglei, et al.
Publicado: (2024)

Linear clique-width and modular decomposition
por: Brignall, Robert, et al.
Publicado: (2026)

On a clique-building game of Erdős
por: Malekshahian, Alexandru, et al.
Publicado: (2024)

Tight bounds towards Zarankiewicz problem in hypergraph
por: Gao, Guorong, et al.
Publicado: (2025)

A Dirac-type theorem for uniform hypergraphs
por: Ma, Yue, et al.
Publicado: (2020)

On resilient hypergraphs
por: Frankl, Peter, et al.
Publicado: (2025)

Reduced clique graphs: a correction to "Chordal graphs and their clique graphs"
por: Mayhew, Dillon, et al.
Publicado: (2023)

Localization of the clique spectral version of Zykov's theorem
por: Bu, Changjiang, et al.
Publicado: (2026)

A note on improved bounds for hypergraph rainbow matching problems
por: Bowtell, Candida, et al.
Publicado: (2025)

Rational exponents for cliques
por: English, Sean, et al.
Publicado: (2024)

Computing the clique number of tournaments
por: Aubian, Guillaume
Publicado: (2024)

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

Density Hajnal--Szemerédi theorem for cliques of size four
por: Hou, Jianfeng, et al.
Publicado: (2025)

On the "second" Kahn--Kalai Conjecture: cliques, cycles, and trees
por: Dubroff, Quentin, et al.
Publicado: (2025)

Large cliques in graphs with forbidden semi-induced structures
por: Chen, Nannan, et al.
Publicado: (2025)

Evasive sets, twisted varieties, and container-clique trees
por: Lim, Jeck, et al.
Publicado: (2025)

Relative discrepancy of hypergraphs
por: Luong-Le, Diep, et al.
Publicado: (2025)

Choosability of multipartite hypergraphs
por: Bradshaw, Peter, et al.
Publicado: (2025)