Saved in:
| Main Authors: | Bal, Deepak, Cutler, Jonathan, Pebody, Luke |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.03355 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Nordhaus-Gaddum inequality for the spectral radius of a graph of order $n$
by: Cheng, Yen-Jen, et al.
Published: (2025)
by: Cheng, Yen-Jen, et al.
Published: (2025)
Nordhaus-Gaddum inequalities for the number of 1-nearly independent vertex subsets
by: Andriantiana, Eric O. D., et al.
Published: (2026)
by: Andriantiana, Eric O. D., et al.
Published: (2026)
A Nordhaus--Gaddum problem for the spectral gap of a graph
by: Kim, Sooyeong, et al.
Published: (2024)
by: Kim, Sooyeong, et al.
Published: (2024)
Sums, Differences and Dilates
by: Cutler, Jonathan, et al.
Published: (2024)
by: Cutler, Jonathan, et al.
Published: (2024)
Line graphs and Nordhaus-Gaddum-type bounds for self-loop graphs
by: Akbari, Saieed, et al.
Published: (2024)
by: Akbari, Saieed, et al.
Published: (2024)
Nordhaus--Gaddum type bounds for the complement rank
by: Tang, Quanyu
Published: (2025)
by: Tang, Quanyu
Published: (2025)
Nordhaus-Gaddum-type theorems for maximum average degree
by: Caro, Yair, et al.
Published: (2025)
by: Caro, Yair, et al.
Published: (2025)
Admissable sets do not exist for all parameters
by: Pebody, Luke
Published: (2024)
by: Pebody, Luke
Published: (2024)
A note on the alternating number of independent sets in a graph
by: Cutler, Jonathan, et al.
Published: (2024)
by: Cutler, Jonathan, et al.
Published: (2024)
On the $4$-clique cover number of graphs
by: Chen, Yihan, et al.
Published: (2025)
by: Chen, Yihan, et al.
Published: (2025)
On the clique covering numbers of Johnson graphs
by: Jørgensen, Søren Fuglede
Published: (2025)
by: Jørgensen, Søren Fuglede
Published: (2025)
Extremal number of cliques of given orders in graphs with a forbidden clique minor
by: Shi, Ruilin, et al.
Published: (2024)
by: Shi, Ruilin, et al.
Published: (2024)
The maximum number of cliques in disjoint copies of graphs
by: Gao, Zhipeng, et al.
Published: (2025)
by: Gao, Zhipeng, et al.
Published: (2025)
The circumference of a graph with given minimum degree and clique number
by: Chen, Na, et al.
Published: (2025)
by: Chen, Na, et al.
Published: (2025)
Odd clique minors in graphs with independence number two
by: Ji, Yuqing, et al.
Published: (2025)
by: Ji, Yuqing, et al.
Published: (2025)
The independence and clique cover numbers of the squarefree graph
by: Alexeev, Boris, et al.
Published: (2025)
by: Alexeev, Boris, et al.
Published: (2025)
A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs
by: Bal, Deepak, et al.
Published: (2023)
by: Bal, Deepak, et al.
Published: (2023)
On the multicolor Ramsey numbers of balanced double stars
by: Bal, Deepak, et al.
Published: (2024)
by: Bal, Deepak, et al.
Published: (2024)
Generalized Ramsey numbers of cycles, paths, and hypergraphs
by: Bal, Deepak, et al.
Published: (2024)
by: Bal, Deepak, et al.
Published: (2024)
The maximum number of cliques in graphs with given fractional matching number and minimum degree
by: Li, Chengli, et al.
Published: (2024)
by: Li, Chengli, et al.
Published: (2024)
Interplay between the local metric dimension and the clique number of a graph
by: Ghalavand, Ali, et al.
Published: (2024)
by: Ghalavand, Ali, et al.
Published: (2024)
Intertwining local (adjacency) metric dimension with the clique number of a graph
by: Ghalavand, Ali, et al.
Published: (2025)
by: Ghalavand, Ali, et al.
Published: (2025)
Coloring graphs with independence number two and no odd clique immersions
by: Echeverría, Henry, et al.
Published: (2026)
by: Echeverría, Henry, et al.
Published: (2026)
The number of edges in graphs with bounded clique number and circumference
by: Dou, Chunyang, et al.
Published: (2024)
by: Dou, Chunyang, et al.
Published: (2024)
Reduced clique graphs: a correction to "Chordal graphs and their clique graphs"
by: Mayhew, Dillon, et al.
Published: (2023)
by: Mayhew, Dillon, et al.
Published: (2023)
Cycles and paths through specified vertices in graphs with a given clique number
by: Li, Chengli, et al.
Published: (2025)
by: Li, Chengli, et al.
Published: (2025)
The clique number of the exact distance $t$-power graph: complexity and eigenvalue bounds
by: Abiad, Aida, et al.
Published: (2024)
by: Abiad, Aida, et al.
Published: (2024)
The maximum number of $k$-cliques of 7-connected 1-planar graphs
by: Huang, Yuanqiu, et al.
Published: (2026)
by: Huang, Yuanqiu, et al.
Published: (2026)
A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Pilipczuk, Marcin, et al.
Published: (2023)
by: Pilipczuk, Marcin, et al.
Published: (2023)
Edge-coloring $K_{n, n}$ with no 2-colored $C_{2k}$
by: Bal, Deepak, et al.
Published: (2025)
by: Bal, Deepak, et al.
Published: (2025)
Maximizing subgraph density in graphs of bounded degree and clique number
by: Kirsch, Rachel
Published: (2025)
by: Kirsch, Rachel
Published: (2025)
On the clique number of random Cayley graphs and related topics
by: Conlon, David, et al.
Published: (2024)
by: Conlon, David, et al.
Published: (2024)
Antimagicness of graphs with a dominating clique
by: Beaudoire, Grégoire, et al.
Published: (2025)
by: Beaudoire, Grégoire, et al.
Published: (2025)
Large monochromatic components in expansive hypergraphs
by: Bal, Deepak, et al.
Published: (2023)
by: Bal, Deepak, et al.
Published: (2023)
The number of cliques in hypergraphs with forbidden subgraphs
by: Basu, Ayush, et al.
Published: (2024)
by: Basu, Ayush, et al.
Published: (2024)
Anti-Ramsey number of intersecting cliques
by: Lu, Hongliang, et al.
Published: (2025)
by: Lu, Hongliang, et al.
Published: (2025)
Computing the clique number of tournaments
by: Aubian, Guillaume
Published: (2024)
by: Aubian, Guillaume
Published: (2024)
Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
by: Botler, Fábio, et al.
Published: (2025)
by: Botler, Fábio, et al.
Published: (2025)
Clique covers and decompositions of cliques of graphs
by: Balogh, József, et al.
Published: (2024)
by: Balogh, József, et al.
Published: (2024)
Packing edge disjoint cliques in graphs
by: Balogh, József, et al.
Published: (2025)
by: Balogh, József, et al.
Published: (2025)
Similar Items
-
Nordhaus-Gaddum inequality for the spectral radius of a graph of order $n$
by: Cheng, Yen-Jen, et al.
Published: (2025) -
Nordhaus-Gaddum inequalities for the number of 1-nearly independent vertex subsets
by: Andriantiana, Eric O. D., et al.
Published: (2026) -
A Nordhaus--Gaddum problem for the spectral gap of a graph
by: Kim, Sooyeong, et al.
Published: (2024) -
Sums, Differences and Dilates
by: Cutler, Jonathan, et al.
Published: (2024) -
Line graphs and Nordhaus-Gaddum-type bounds for self-loop graphs
by: Akbari, Saieed, et al.
Published: (2024)