Triangle-Free Graphs with High Minimal Degrees

DOI10.1017/S0963548300000845MaRDI QIDQ4290098zbMATH OpenFDO

Authors Guoping Jin

Publication date 24 July 1994

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

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

zbMATH Keywords

minimal degreetriangle-free graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• On the structure of triangle-free graphs of large minimum degree
• On the chromatic number of triangle-free graphs of large minimum degree
• On the Structure of Dense Triangle-Free Graphs
• Triangle-free subgraphs of random graphs
• On maximal triangle‐free graphs

Cites work

• On a valence problem in extremal graph theory
• On the connection between chromatic number, maximal clique and minimal degree of a graph

Cited in

(17)

• Triangle-free circuit decompositions and Petersen minor
• High-girth graphs avoiding a minor are nearly bipartite
• On the minimal degree condition of graphs implying equality of the largest K_r-free subgraphs and (r - 1)-partite subgraphs
• On triangle-free regular graphs containing a cut vertex
• Graphs of odd girth 7 with large degree
• Dense graphs with small clique number
• Triangle-free subgraphs of random graphs
• On the Structure of Dense Triangle-Free Graphs
• Triangle-Free Graphs with Large Degree
• Cycle-maximal triangle-free graphs
• scientific article; zbMATH DE number 1866931 (Why is no real title available?)
• A lower bound for the energy of graphs in terms of the vertex cover number
• A note on generalized pentagons
• Asymmetric results about graph homomorphisms
• Minimum degree of 3-graphs without long linear paths
• On the structure of triangle-free graphs of large minimum degree
• On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs

This page was built for publication: Triangle-Free Graphs with High Minimal Degrees

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