𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extremal Graphs without Topological Complete Subgraphs

✍ Scribed by Cera, M.; Diánez, A.; Márquez, A.


Book ID
118198058
Publisher
Society for Industrial and Applied Mathematics
Year
2004
Tongue
English
Weight
163 KB
Volume
18
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Extremal Digraph Results for Topological
✍ C. Jagger 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 143 KB

We determine, to within a constant factor, the maximum size of a digraph that does not contain a topological complete digraph DK p of order p. Let t 1 ( p) be defined for positive p by where D denotes a digraph. We show that 1 16 p 2 < t 1 ( p) ≤ 44 p 2 . We also obtain results for containing topol

Extremal graphs without a semi-topologic
✍ Elad Horev 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB

For 2 ≤ r ∈ N, let S r denote the class of graphs consisting of subdivisions of the wheel graph with r spokes in which the spoke edges are left undivided. Let ex(n, S r ) denote the maximum number of edges of a graph containing no S r -subgraph, and let Ex(n, S r ) denote the set of all n-vertex gra

Extremal subgraphs for two graphs
✍ F.R.K Chung; P Erdös; J Spencer 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 564 KB
Extremal subgraphs of random graphs
✍ Graham Brightwell; Konstantinos Panagiotou; Angelika Steger 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 698 KB