Triangle-Free Graphs with Large Degree

DOI10.1017/S0963548397003167MaRDI QIDQ4372989zbMATH OpenOpenAlexFDO

Authors C. C. Chen, Guoping Jin, K. M. Koh

Publication date 12 March 1998

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548397003167

zbMATH Keywords

Mycielski graphGroetzsch graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• Triangle-Free Graphs with High Minimal Degrees
• On the structure of triangle-free graphs of large minimum degree
• Triangle-free graphs with large chromatic numbers
• Maximal triangle‐free graphs with restrictions on the degrees
• Graphs without large triangle free subgraphs
• Triangle-free graphs with large independent domination number
• scientific article; zbMATH DE number 5917767
• On maximal triangle‐free graphs
• scientific article; zbMATH DE number 1208712
• On degree sums of a triangle-free graph

Cited in

(13)

• On the structure of triangle-free graphs of large minimum degree
• The chromatic profile of locally colourable graphs
• Triangle-free graphs with large independent domination number
• A 4-colour problem for dense triangle-free graphs
• Triangle-free four-chromatic graphs
• Dense graphs with small clique number
• The minimum degree removal lemma thresholds
• On the Structure of Graphs with Given Odd Girth and Large Minimum Degree
• The chromatic profile of locally bipartite graphs
• Degree sequences in triangle-free graphs
• Sparse halves in dense triangle-free graphs
• The binding number of a graph and its cliques
• There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10

This page was built for publication: Triangle-Free Graphs with Large Degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4372989)