On the edge distribution in triangle-free graphs

DOI10.1006/JCTB.1995.1018zbMATH Open0824.05033OpenAlexW2056840457MaRDI QIDQ1892845FDOQ1892845

Authors: Michael Krivelevich 

Publication date: 2 July 1995

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1995.1018

Recommendations

• scientific article; zbMATH DE number 850231
• Large triangle-free subgraphs in graphs without \(K_ 4\)
• Size and independence in triangle‐free graphs with maximum degree three
• On a problem of Erdős and Rothschild on edges in triangles
• Graphs without large triangle free subgraphs

zbMATH Keywords

trianglerandom graphtriangle-free graphedge distribution

Mathematics Subject Classification ID

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

Cited In (14)

• Intersections of graphs
• No dense subgraphs appear in the triangle-free graph process
• Sparse halves in triangle-free graphs
• Making a \(K_4\)-free graph bipartite
• For which densities are random triangle-free graphs almost surely bipartite?
• The local density of triangle-free graphs
• More about sparse halves in triangle-free graphs
• 10 problems for partitions of triangle-free graphs
• Edge distribution and density in the characteristic sequence
• Intersections of hypergraphs
• Sparse halves in dense triangle-free graphs
• Sparse halves in K4‐free graphs
• Triangle-free subgraphs of powers of cycles
• K4$K_4$‐free graphs have sparse halves

This page was built for publication: On the edge distribution in triangle-free graphs

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