Counting cliques with prescribed intersection sizes
Fuente:
arXiv
Guardado en:
| Autores principales: | Zhao, Yuhao, Zhang, Xiande |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
On low-power error-correcting cooling codes with large distances
por: Zhao, Yuhao, et al.
Publicado: (2024)
por: Zhao, Yuhao, et al.
Publicado: (2024)
Improved upper bounds for wide-sense frameproof codes
por: Zhao, Yuhao, et al.
Publicado: (2024)
por: Zhao, Yuhao, et al.
Publicado: (2024)
On set systems with strongly restricted intersections
por: Wei, Xin, et al.
Publicado: (2024)
por: Wei, Xin, et al.
Publicado: (2024)
Anti-Ramsey number of intersecting cliques
por: Lu, Hongliang, et al.
Publicado: (2025)
por: Lu, Hongliang, et al.
Publicado: (2025)
Counting induced subgraphs with given intersection sizes
por: Zhang, Haixiang, et al.
Publicado: (2025)
por: Zhang, Haixiang, et al.
Publicado: (2025)
Focal-free uniform hypergraphs and codes
por: Huang, Xinqi, et al.
Publicado: (2024)
por: Huang, Xinqi, et al.
Publicado: (2024)
Counting cliques without generalized theta graphs
por: Gao, Jun, et al.
Publicado: (2023)
por: Gao, Jun, et al.
Publicado: (2023)
Density Hajnal--Szemerédi theorem for cliques of size four
por: Hou, Jianfeng, et al.
Publicado: (2025)
por: Hou, Jianfeng, et al.
Publicado: (2025)
Reconstruction of hypermatrices from subhypermatrices
por: Zhang, Xiande, et al.
Publicado: (2024)
por: Zhang, Xiande, et al.
Publicado: (2024)
Trace reconstruction of matrices and hypermatrices
por: Zhong, Wenjie, et al.
Publicado: (2024)
por: Zhong, Wenjie, et al.
Publicado: (2024)
The maximum sum of sizes of non-empty cross $L$-intersecting families
por: Zhao, Xiamiao, et al.
Publicado: (2025)
por: Zhao, Xiamiao, et al.
Publicado: (2025)
The maximum sum of the size of all intersections within intersecting families and crossing-intersecting families
por: Huang, Sumin
Publicado: (2024)
por: Huang, Sumin
Publicado: (2024)
Quantitative Frameproof Codes and Hypergraphs
por: Zhong, Wenjie, et al.
Publicado: (2025)
por: Zhong, Wenjie, et al.
Publicado: (2025)
The number of cliques in hypergraphs with forbidden subgraphs
por: Basu, Ayush, et al.
Publicado: (2024)
por: Basu, Ayush, et al.
Publicado: (2024)
On cliques in hypergraphs
por: Gao, Jun
Publicado: (2025)
por: Gao, Jun
Publicado: (2025)
Counting k-ary words by number of adjacency differences of a prescribed size
por: Fried, Sela, et al.
Publicado: (2025)
por: Fried, Sela, 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)
por: Shi, Ruilin, et al.
Publicado: (2024)
Improvements on Permutation Reconstruction from Minors
por: Ma, Yiming, et al.
Publicado: (2024)
por: Ma, Yiming, et al.
Publicado: (2024)
The maximum product of sizes of cross-\(t\)-intersecting families
por: Bao, Jingjun, et al.
Publicado: (2025)
por: Bao, Jingjun, et al.
Publicado: (2025)
Improved Bounds for Codes over Trees
por: Li, Yanzhi, et al.
Publicado: (2025)
por: Li, Yanzhi, et al.
Publicado: (2025)
Topological cliques in sparse expanders
por: Wang, Xia, et al.
Publicado: (2024)
por: Wang, Xia, et al.
Publicado: (2024)
Counting Hamiltonian paths between prescribed vertices in traceable graphs with a forbidden induced subgraph
por: Jooken, Jorik, et al.
Publicado: (2026)
por: Jooken, Jorik, et al.
Publicado: (2026)
The maximum sum of the sizes of all intersections within $m$-size families
por: Huang, Sumin, et al.
Publicado: (2024)
por: Huang, Sumin, et al.
Publicado: (2024)
Extremal 1-planar graphs without k-cliques
por: Zhang, Licheng, et al.
Publicado: (2026)
por: Zhang, Licheng, et al.
Publicado: (2026)
Odd clique minors in graphs with independence number two
por: Ji, Yuqing, et al.
Publicado: (2025)
por: Ji, Yuqing, et al.
Publicado: (2025)
On the $4$-clique cover number of graphs
por: Chen, Yihan, et al.
Publicado: (2025)
por: Chen, Yihan, et al.
Publicado: (2025)
On the clique covering numbers of Johnson graphs
por: Jørgensen, Søren Fuglede
Publicado: (2025)
por: Jørgensen, Søren Fuglede
Publicado: (2025)
On the Ramsey-Turán problem for 4-cliques
por: Csaba, Béla
Publicado: (2025)
por: Csaba, Béla
Publicado: (2025)
Packing edge disjoint cliques in graphs
por: Balogh, József, et al.
Publicado: (2025)
por: Balogh, József, et al.
Publicado: (2025)
Antimagicness of graphs with a dominating clique
por: Beaudoire, Grégoire, et al.
Publicado: (2025)
por: Beaudoire, Grégoire, et al.
Publicado: (2025)
Spanning clique subdivisions in pseudorandom graphs
por: Lee, Hyunwoo, et al.
Publicado: (2025)
por: Lee, Hyunwoo, et al.
Publicado: (2025)
Generalized Ramsey--Turán density for cliques
por: Gao, Jun, et al.
Publicado: (2024)
por: Gao, Jun, et al.
Publicado: (2024)
Weak saturation of tensor product of cliques
por: Terekhov, Nikolai
Publicado: (2026)
por: Terekhov, Nikolai
Publicado: (2026)
Clique covers and decompositions of cliques of graphs
por: Balogh, József, et al.
Publicado: (2024)
por: Balogh, József, et al.
Publicado: (2024)
Many cliques with small degree powers
por: Chao, Ting-Wei, et al.
Publicado: (2024)
por: Chao, Ting-Wei, et al.
Publicado: (2024)
Embedding clique subdivisions via crux
por: Yang, Donglei, et al.
Publicado: (2024)
por: Yang, Donglei, et al.
Publicado: (2024)
Linear clique-width and modular decomposition
por: Brignall, Robert, et al.
Publicado: (2026)
por: Brignall, Robert, et al.
Publicado: (2026)
On a clique-building game of Erdős
por: Malekshahian, Alexandru, et al.
Publicado: (2024)
por: Malekshahian, Alexandru, et al.
Publicado: (2024)
Ramsey sequences with bounded clique size
por: Aher, Abhishek Girish, et al.
Publicado: (2025)
por: Aher, Abhishek Girish, et al.
Publicado: (2025)
The maximum sum of sizes of non-empty cross $t$-intersecting families
por: Li, Shuang, et al.
Publicado: (2023)
por: Li, Shuang, et al.
Publicado: (2023)
Ejemplares similares
-
On low-power error-correcting cooling codes with large distances
por: Zhao, Yuhao, et al.
Publicado: (2024) -
Improved upper bounds for wide-sense frameproof codes
por: Zhao, Yuhao, et al.
Publicado: (2024) -
On set systems with strongly restricted intersections
por: Wei, Xin, et al.
Publicado: (2024) -
Anti-Ramsey number of intersecting cliques
por: Lu, Hongliang, et al.
Publicado: (2025) -
Counting induced subgraphs with given intersection sizes
por: Zhang, Haixiang, et al.
Publicado: (2025)