On the clique covering numbers of Johnson graphs
Fuente:
arXiv
Guardado en:
| Autor principal: | Jørgensen, Søren Fuglede |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
On the $4$-clique cover number of graphs
por: Chen, Yihan, et al.
Publicado: (2025)
por: Chen, Yihan, et al.
Publicado: (2025)
The independence and clique cover numbers of the squarefree graph
por: Alexeev, Boris, et al.
Publicado: (2025)
por: Alexeev, Boris, et al.
Publicado: (2025)
Clique covers and decompositions of cliques of graphs
por: Balogh, József, et al.
Publicado: (2024)
por: Balogh, József, et al.
Publicado: (2024)
When do graph covers preserve the clique dynamics of infinite graphs?
por: Limbach, Anna M., et al.
Publicado: (2025)
por: Limbach, Anna M., 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)
The maximum number of cliques in disjoint copies of graphs
por: Gao, Zhipeng, et al.
Publicado: (2025)
por: Gao, Zhipeng, et al.
Publicado: (2025)
On the chromatic numbers of Johnson type graphs
por: Cherkashin, Danila
Publicado: (2025)
por: Cherkashin, Danila
Publicado: (2025)
Odd clique minors in graphs with independence number two
por: Ji, Yuqing, et al.
Publicado: (2025)
por: Ji, Yuqing, et al.
Publicado: (2025)
Nordhaus-Gaddum inequalities for the number of cliques in a graph
por: Bal, Deepak, et al.
Publicado: (2024)
por: Bal, Deepak, et al.
Publicado: (2024)
The maximum number of cliques in graphs with given fractional matching number and minimum degree
por: Li, Chengli, et al.
Publicado: (2024)
por: Li, Chengli, et al.
Publicado: (2024)
The circumference of a graph with given minimum degree and clique number
por: Chen, Na, et al.
Publicado: (2025)
por: Chen, Na, et al.
Publicado: (2025)
Coloring graphs with independence number two and no odd clique immersions
por: Echeverría, Henry, et al.
Publicado: (2026)
por: Echeverría, Henry, et al.
Publicado: (2026)
On minimal free resolutions of the cover ideals of clique-whiskered graphs
por: Muta, Yuji, et al.
Publicado: (2025)
por: Muta, Yuji, et al.
Publicado: (2025)
Intertwining local (adjacency) metric dimension with the clique number of a graph
por: Ghalavand, Ali, et al.
Publicado: (2025)
por: Ghalavand, Ali, et al.
Publicado: (2025)
Interplay between the local metric dimension and the clique number of a graph
por: Ghalavand, Ali, et al.
Publicado: (2024)
por: Ghalavand, Ali, et al.
Publicado: (2024)
The maximum number of $k$-cliques of 7-connected 1-planar graphs
por: Huang, Yuanqiu, et al.
Publicado: (2026)
por: Huang, Yuanqiu, et al.
Publicado: (2026)
The clique number of the exact distance $t$-power graph: complexity and eigenvalue bounds
por: Abiad, Aida, et al.
Publicado: (2024)
por: Abiad, Aida, et al.
Publicado: (2024)
The number of edges in graphs with bounded clique number and circumference
por: Dou, Chunyang, et al.
Publicado: (2024)
por: Dou, Chunyang, et al.
Publicado: (2024)
A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
por: Pilipczuk, Marcin, et al.
Publicado: (2023)
por: Pilipczuk, Marcin, et al.
Publicado: (2023)
Cycles and paths through specified vertices in graphs with a given clique number
por: Li, Chengli, et al.
Publicado: (2025)
por: Li, Chengli, et al.
Publicado: (2025)
Reduced clique graphs: a correction to "Chordal graphs and their clique graphs"
por: Mayhew, Dillon, et al.
Publicado: (2023)
por: Mayhew, Dillon, et al.
Publicado: (2023)
Maximizing subgraph density in graphs of bounded degree and clique number
por: Kirsch, Rachel
Publicado: (2025)
por: Kirsch, Rachel
Publicado: (2025)
On the clique number of random Cayley graphs and related topics
por: Conlon, David, et al.
Publicado: (2024)
por: Conlon, David, et al.
Publicado: (2024)
Anti-Ramsey number of intersecting cliques
por: Lu, Hongliang, et al.
Publicado: (2025)
por: Lu, Hongliang, 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)
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)
Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
por: Botler, Fábio, et al.
Publicado: (2025)
por: Botler, Fábio, et al.
Publicado: (2025)
Computing the clique number of tournaments
por: Aubian, Guillaume
Publicado: (2024)
por: Aubian, Guillaume
Publicado: (2024)
Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
por: Chudnovsky, Maria, et al.
Publicado: (2024)
por: Chudnovsky, Maria, et al.
Publicado: (2024)
On the maximum number of $r$-cliques in graphs free of complete $r$-partite subgraphs
por: Balogh, József, et al.
Publicado: (2024)
por: Balogh, József, et al.
Publicado: (2024)
The anti-Ramsey numbers of cliques in complete multi-partite graphs
por: An, Yuyu, et al.
Publicado: (2024)
por: An, Yuyu, et al.
Publicado: (2024)
A note on the maximum ratio between chromatic number and clique number
por: Araujo, Igor, et al.
Publicado: (2025)
por: Araujo, Igor, et al.
Publicado: (2025)
Calculating the maximum number of maximum cliques for simple graphs
por: Pfeifer, Dániel
Publicado: (2023)
por: Pfeifer, Dániel
Publicado: (2023)
Counting cliques without generalized theta graphs
por: Gao, Jun, et al.
Publicado: (2023)
por: Gao, Jun, et al.
Publicado: (2023)
Chromatic numbers for contact graphs of congruent cuboids
por: Eilers, Søren, et al.
Publicado: (2025)
por: Eilers, Søren, et al.
Publicado: (2025)
The clique chromatic number of sparse random graphs
por: Fernandez V, Manuel, et al.
Publicado: (2024)
por: Fernandez V, Manuel, et al.
Publicado: (2024)
Kronecker classes and cliques in derangement graphs
por: Cazzola, Marina, et al.
Publicado: (2025)
por: Cazzola, Marina, et al.
Publicado: (2025)
On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme
por: Abiad, Aida, et al.
Publicado: (2023)
por: Abiad, Aida, et al.
Publicado: (2023)
Ejemplares similares
-
On the $4$-clique cover number of graphs
por: Chen, Yihan, et al.
Publicado: (2025) -
The independence and clique cover numbers of the squarefree graph
por: Alexeev, Boris, et al.
Publicado: (2025) -
Clique covers and decompositions of cliques of graphs
por: Balogh, József, et al.
Publicado: (2024) -
When do graph covers preserve the clique dynamics of infinite graphs?
por: Limbach, Anna M., 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)