scientific article; zbMATH DE number 125455

MaRDI QIDQ4027154zbMATH OpenFDO

Authors P. Erdős

Publication date 21 February 1993

zbMATH Keywords

combinatoricsErdős problemsgraph theoryproblems

Mathematics Subject Classification ID

Problem books (00A07) Enumerative combinatorics (05Axx) Graph theory (05Cxx)

Cited in

(11)

• On the sizes of large subgraphs of the binomial random graph
• Induced 2-regular subgraphs in k-chordal cubic graphs
• scientific article; zbMATH DE number 981684 (Why is no real title available?)
• scientific article; zbMATH DE number 25254 (Why is no real title available?)
• Improved bound on the maximum number of clique-free colorings with two and three colors
• Induced cycles in graphs
• Proof of a conjecture on induced subgraphs of Ramsey graphs
• A combinatorial mathematician in Norway: Some personal reflections
• A bipartite version of the Erdős–McKay conjecture
• Induced cycles vertex number and (1,2)-domination in cubic graphs
• A strengthening on consecutive odd cycles in graphs of given minimum degree

This page was built for publication:

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