✦ LIBER ✦

Weights of induced subgraphs in -free graphs

✍ Scribed by Anja Pruchnewski; Margit Voigt

Book ID: 113567685
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 218 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.04.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum regular induced subgraphs in -fr

Maximum regular induced subgraphs in -free graphs

✍ Lozin, Vadim V.; Mosca, Raffaele 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 245 KB

Forbidden induced subgraphs for star-fre

Forbidden induced subgraphs for star-free graphs

✍ Jun Fujisawa; Katsuhiro Ota; Kenta Ozeki; Gabriel Sueiro 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 291 KB

Bipartite Subgraphs of Triangle-Free Gra

Bipartite Subgraphs of Triangle-Free Graphs

✍ Poljak, Svatopluk; Tuza, Zsolt 📂 Article 📅 1994 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 697 KB

Special subgraphs of weighted visibility

Special subgraphs of weighted visibility graphs

✍ F.R. Hsu; R.C.T. Lee; R.C. Chang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 510 KB

Bipartite subgraphs of integer weighted

Bipartite subgraphs of integer weighted graphs

✍ Noga Alon; Eran Halperin 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 411 KB

For every integer p > 0, let f(p) be the minimum possible value of the maximum weight of a cut in an integer weighted graph with total weight p. It is shown that for every large n and every m < n, f((~)+m)= L¼n2j +min (I½nT,f(m)). This supplies the precise value of f(p) for many values of p includin

Large triangle-free subgraphs in graphs

Large triangle-free subgraphs in graphs withoutK4

✍ P. Frankl; V. Rödl 📂 Article 📅 1986 🏛 Springer Japan 🌐 English ⚖ 504 KB