The number of oriantations having no fixed tournament
From MaRDI portal
Publication:2495691
DOI10.1007/S00493-006-0001-6zbMath1107.05040OpenAlexW2085149397WikidataQ105583368 ScholiaQ105583368MaRDI QIDQ2495691
Publication date: 2 January 2007
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-006-0001-6
Related Items (19)
Stability for the Erdős-Rothschild problem ⋮ A remark on the number of edge colorings of graphs ⋮ Remarks on an edge-coloring problem ⋮ Counting H-free orientations of graphs ⋮ On the maximum number of integer colourings with forbidden monochromatic sums ⋮ Shattering, graph orientations, and connectivity ⋮ Counting orientations of graphs with no strongly connected tournaments ⋮ On the number of orientations of random graphs with no directed cycles of a given length ⋮ On the number of \(r\)-transitive orientations of \(G(n,p)\) ⋮ A Rainbow Erdös--Rothschild Problem ⋮ The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques ⋮ Edge-colorings avoiding patterns in a triangle ⋮ Counting orientations of random graphs with no directed k‐cycles ⋮ Structure and enumeration theorems for hereditary properties in finite relational languages ⋮ Graphs with many edge-colorings such that complete graphs are rainbow ⋮ Counting restricted orientations of random graphs ⋮ On the structure of oriented graphs and digraphs with forbidden tournaments or cycles ⋮ An extension of the rainbow Erdős-Rothschild problem ⋮ A note on counting orientations
This page was built for publication: The number of oriantations having no fixed tournament
