✦ LIBER ✦

Turán Numbers of Subdivided Graphs

✍ Scribed by Jiang, Tao; Seiver, Robert

Book ID: 115455086
Publisher: Society for Industrial and Applied Mathematics
Year: 2012
Tongue: English
Weight: 313 KB
Volume: 26
Category: Article
ISSN: 0895-4801
DOI: 10.1137/100819254

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Norm-graphs and bipartite turán numbers

✍ János Kollár; Lajos Rónyai; Tibor Szabó 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 384 KB

Turán Numbers for Disjoint Copies of Gra

Turán Numbers for Disjoint Copies of Graphs

✍ Izolda Gorgol 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 119 KB

Turán Graphs and the Number of Colorings

✍ Norine, Serguei 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 163 KB

Anti-Ramsey Numbers of Subdivided Graphs

✍ Tao Jiang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 88 KB

Given a positive integer n and a family F of graphs, the anti-Ramsey number f(n, F) is the maximum number of colors in an edge-coloring of K n such that no subgraph of K n belonging to F has distinct colors on its edges. The Tura ´n number ex(n, F) is the maximum number of edges of an n-vertex graph

On two Turán Numbers

✍ Jian Shen 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 85 KB

Mean Ramsey–Turán numbers

✍ Raphael Yuster 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

## Abstract A ρ‐mean coloring of a graph is a coloring of the edges such that the average number of colors incident with each vertex is at most ρ. For a graph __H__ and for ρ ≥ 1, the __mean Ramsey–Turán number RT__(__n, H,ρ − mean__) is the maximum number of edges a ρ‐__mean__ colored graph with _