Graphic sequences with a realization containing intersecting cliques
From MaRDI portal
Recommendations
- Graphic sequences with a realization containing a friendship graph
- Graphic sequences with a realization containing a generalized friendship graph
- Graphic sequences with a realization containing a union of cliques
- Potentially \(F'_{k_1,k_2,1}\)-graphic sequences
- Graphic sequences that have a realization with large clique number
Cites work
- scientific article; zbMATH DE number 5572978 (Why is no real title available?)
- scientific article; zbMATH DE number 1286471 (Why is no real title available?)
- scientific article; zbMATH DE number 867707 (Why is no real title available?)
- A General Lower Bound for Potentially H-Graphic Sequences
- An extremal problem on potentially \(K_m-C_4\)-graphic sequences
- An extremal problem on potentially \(K_{r,s}\)-graphic sequences
- An extremal problem on the potentially \(P_k\)-graphic sequences
- Extremal graphs for intersecting cliques
- Extremal graphs for intersecting triangles
- Graphic sequences with a realization containing a friendship graph
- Graphic sequences with a realization containing a generalized friendship graph
- Graphic sequences with a realization containing a union of cliques
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On potentially \(K_{r_1,r_2,\dots,r_m}\)-graphic sequences
- Potentially \(F'_{k_1,k_2,1}\)-graphic sequences
- The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true
- The smallest degree sum that yields potentially \(K_{r,r}\)-graphic sequences
- The threshold for the Erdős, Jacobson and Lehel conjecture to be true
- Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
Cited in
(3)
This page was built for publication: Graphic sequences with a realization containing intersecting cliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q270273)
