On the edge distribution in triangle-free graphs

DOI10.1006/JCTB.1995.1018MaRDI QIDQ1892845zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

trianglerandom graphtriangle-free graphedge distribution

Mathematics Subject Classification ID

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

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

Cited in

(15)

• No dense subgraphs appear in the triangle-free graph process
• Intersections of graphs
• Sparse halves in triangle-free graphs
• Making a K₄-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
• Edge distribution and density in the characteristic sequence
• 10 problems for partitions of triangle-free graphs
• Intersections of hypergraphs
• Sparse halves in dense triangle-free graphs
• A local density condition for triangles
• 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)