Counting graph orientations with no directed triangles

DOI10.37236/12923MaRDI QIDQ6925711zbMATH OpenFDO

Authors Pedro Araújo, F. Botler, G. O. Mota

Publication date 25 September 2025

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/12923

zbMATH Keywords

cliqueenumeration

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35)

Cites work

• Counting restricted orientations of random graphs
• Graph theory
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3487496 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 881297 (Why is no real title available?)
• On the number of orientations of random graphs with no directed cycles of a given length
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• The number of oriantations having no fixed tournament
• Vraagstuk XXVIII.

This page was built for publication: Counting graph orientations with no directed triangles

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