Graphic sequences that have a realization with large clique number
DOI10.1002/(SICI)1097-0118(200005)34:1%3C20::AID-JGT3%3E3.0.CO;2-VzbMATH Open0953.05013OpenAlexW4241343272MaRDI QIDQ4487072FDOQ4487072
Authors: Dhruv Mubayi
Publication date: 1 February 2001
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200005)34:1%3C20::aid-jgt3%3E3.0.co;2-v
Recommendations
Partial orders, general (06A06) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07) Graph theory (05C99)
Cites Work
Cited In (9)
- Title not available (Why is that?)
- Graphic sequences with a realization containing intersecting cliques
- Potentially K m — G-graphical sequences: A survey
- Finding structure in sequences of real numbers via graph theory: a problem list
- Graphic Sequences Have Realizations Containing Bisections of Large Degree
- An extremal problem on graphic sequences with a realization containing every \(\ell \)-tree on \(k\) vertices
- Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
- Sequences, claws and cyclability of graphs
- Cliques in realization graphs
This page was built for publication: Graphic sequences that have a realization with large clique number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4487072)