Graphs without large triangle free subgraphs

DOI10.1016/0012-365X(91)90042-ZMaRDI QIDQ1174161zbMATH OpenOpenAlexFDO

Authors S. Singh

Publication date 25 June 1992

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(91)90042-z

zbMATH Keywords

clique numberrandom graphstriangle free subgraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• Large triangle-free subgraphs in graphs without \(K_ 4\)
• On the edge distribution in triangle-free graphs
• The typical structure of graphs with no large cliques
• Triangle-free subgraphs of random graphs

Cites work

• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3711961 (Why is no real title available?)
• scientific article; zbMATH DE number 3637904 (Why is no real title available?)
• Graph Theory and Probability
• Graph Theory and Probability. II
• The Construction of Certain Graphs

Cited in

(25)

• Graphs without theta subgraphs
• On the number of graphs without large cliques
• Local-Global Phenomena in Graphs
• Extremal Graphs without Large Forbidden Subgraphs
• On the minimum degree of minimal Ramsey graphs for multiple colours
• Constructive bounds for a Ramsey-type problem
• On the minimal number of edges in color-critical graphs
• Some induced subgraphs of strongly regular graphs with no triangles
• Triangle-Free Graphs with Large Degree
• On the Ramsey-Turán number with small \(s\)-independence number
• Large triangle-free subgraphs in graphs without \(K_ 4\)
• \(K_4\)-free graphs without large induced triangle-free subgraphs
• On generalized Ramsey numbers for 3-uniform hypergraphs
• On the stability of the graph independence number
• On vertex Ramsey graphs with forbidden subgraphs
• scientific article; zbMATH DE number 4139791 (Why is no real title available?)
• K^s-Free Graphs Without Large K^r-Free Subgraphs
• An almost quadratic bound on vertex Folkman numbers
• On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers
• On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph
• On generalized Ramsey numbers of Erdős and Rogers
• Each 11-vertex graph without 4-cliques has a triangle-free 2-partition of vertices
• When does the \(K_{4}\)-free process stop?
• scientific article; zbMATH DE number 493467 (Why is no real title available?)
• No dense subgraphs appear in the triangle-free graph process

This page was built for publication: Graphs without large triangle free subgraphs

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