Making a C6-free graph C4-free and bipartite

被引：1

作者：

Gyori, Ervin ^{[1
,2
]}

Kensell, Scott ^{[2
]}

Tompkins, Casey ^{[2
]}

机构：

[1] Hungarian Acad Sci, MTA Renyi Inst, Budapest, Hungary

[2] Cent European Univ, Dept Math, Budapest, Hungary

来源：

DISCRETE APPLIED MATHEMATICS | 2016年 / 209卷

基金：

匈牙利科学研究基金会;

关键词：

Graph theory; Extremal graphs; Bipartite subgraphs; 6-cycles; 4-cycles;

D O I：

10.1016/j.dam.2015.06.008

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We show that every C-6-free graph G has a C-4-free, bipartite subgraph with at least 3e(G)/8 edges. Our proof is probabilistic and uses a theorem of Furedi et al. (2006) on C-6-free graphs. (C) 2015 Elsevier B.V. All rights reserved.

引用

页码：133 / 136

页数：4

共 50 条

[31] Extensions on spectral extrema of C5/C6-free graphs with given size
Sun, Wanting
Li, Shuchao
Wei, Wei
DISCRETE MATHEMATICS, 2023, 346 (12)
[32] RECOGNITION OF C4-FREE AND 1/2-HYPERBOLIC GRAPHS
Coudert, David
Ducoffe, Guillaume
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2014, 28 (03) : 1601 - 1617
[33] ON THE MAXIMUM NUMBER OF EDGES IN A C4-FREE SUBGRAPH OF Q(N)
BRASS, P
HARBORTH, H
NIENBORG, H
JOURNAL OF GRAPH THEORY, 1995, 19 (01) : 17 - 23
[34] Upper bounds on the average eccentricity of K3-free and C4-free graphs
Dankelmann, P.
Osaye, F. J.
Mukwembi, S.
Rodrigues, B. G.
DISCRETE APPLIED MATHEMATICS, 2019, 270 : 106 - 114
[35] Every graph of sufficiently large average degree contains a C4-Free subgraph of large average degree
Kühn, D
Osthus, D
COMBINATORICA, 2004, 24 (01) : 155 - 162
[36] Every Graph of Sufficiently Large Average Degree Contains a C4-Free Subgraph of Large Average Degree
Daniela Kühn
Deryk Osthus
Combinatorica, 2004, 24 : 155 - 162
[37] Proximity and remoteness in triangle-free and C4-free graphs in terms of order and minimum degree
Dankelmann, P.
Jonck, E.
Mafunda, S.
DISCRETE MATHEMATICS, 2021, 344 (09)
[38] The maximum spectral radius of C4-free graphs of given order and size
Nikiforov, Vladimir
LINEAR ALGEBRA AND ITS APPLICATIONS, 2009, 430 (11-12) : 2898 - 2905
[39] On the difference between proximity and other distance parameters in triangle-free graphs and C4-free graphs
Dankelmann, Peter
Mafunda, Sonwabile
DISCRETE APPLIED MATHEMATICS, 2022, 321 : 295 - 307
[40] The Sharp Upper Bounds on the Aα-Spectral Radius of C4-Free Graphs and Halin Graphs
Guo, Shu-Guang
Zhang, Rong
GRAPHS AND COMBINATORICS, 2022, 38 (01)

← 1 2 3 4 5 →