| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 418465 | Discrete Applied Mathematics | 2016 | 4 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ervin Győri, Scott Kensell, Casey Tompkins,