| Tartalom: |
http://real.mtak.hu/44158/ |
| Archívum: |
MTA Könyvtár |
| Gyűjtemény: |
Status = Published
Type = Article
|
| Cím: |
Making a C6C6-free graph C4C4-free and bipartite
|
| Létrehozó: |
Győri, Ervin
Kensell, Scott
Tompkins, Casey
|
| Kiadó: |
Elsevier
|
| Dátum: |
2016
|
| Téma: |
QA Mathematics / matematika
QA166-QA166.245 Graphs theory / gráfelmélet
|
| Tartalmi leírás: |
We show that every C6C6-free graph GG has a C4C4-free, bipartite subgraph with at least 3e(G)/83e(G)/8 edges. Our proof is probabilistic and uses a theorem of FĂĽredi et al. (2006) on C6C6-free graphs.
|
| Nyelv: |
angol
magyar
|
| Típus: |
Article
PeerReviewed
info:eu-repo/semantics/article
|
| Formátum: |
text
text
|
| Azonosító: |
Győri, Ervin and Kensell, Scott and Tompkins, Casey (2016) Making a C6C6-free graph C4C4-free and bipartite. DISCRETE APPLIED MATHEMATICS, 209. pp. 133-136. ISSN 0166-218X
|
| Kapcsolat: |
MTMT:2953784
|
