05c20

Documents about 05c20

• Tournaments with many Hamilton cycles#1327835arXiv (All)
• Potatoes and Onions#1355315arXiv (All)
• Polynomial Compressibility and Forbidden Oriented Forests#1118312arXiv (All)
• Fast robbers on abelian Cayley graphs and digraphs#926222arXiv (All)
• Wild frieze patterns over the integers#1034939arXiv (All)
• Enumerating Hamiltonian Paths and Cycles#1215739arXiv (All)
• Saturation and semisaturation of oriented graphs#1344100arXiv (All)
• Feedback edge set in bipartite digraph#974038arXiv (All)
• Antidirected forests in digraphs#1012651arXiv (All)
• Erdős-Sós via random cyclic orderings#1035127arXiv (All)
• The maximum number of Hamiltonian cycles in tournaments#1388127arXiv (All)
• Random Tournaments Are Asymptotically Almost Surely Link-irregular#1389577arXiv (All)
• Nearly balanced spanning subdivisions in dense digraphs#609602arXiv (All)
• Counting Successor-Closed Subsets of Functional Digraphs#789918arXiv (OAI Expanded)
• Counting Successor-Closed Subsets of Functional Digraphs#793937arXiv (All)
• Tight paths in fully directed hypergraphs#821761arXiv (All)
• Arc-distinguishing of orientations of graphs#997906arXiv (All)
• Tournaments not inducible by five voters#1083416arXiv (OAI Expanded)
• Acyclic orientations of mixed graphs#1116734arXiv (All)
• Rainbow Turán numbers for paths of length four#1142774arXiv (All)
• Encoding and Enumerating Acyclic Orientations of Graphs#1200707arXiv (All)
• Oriented trees in digraphs without short non-directed cycles#1217317arXiv (All)
• Tournaments, flags, and spinors#1343276arXiv (All)
• Percolation on Bidirected Graphs#1413003arXiv (All)
• Trees with Prescribed Maximum Degree and Spectral Radius#797180arXiv (OAI Expanded)
• Trees with Prescribed Maximum Degree and Spectral Radius#798593arXiv (All)
• Hamilton Starters and Path Decompositions in Directed Circulants#821211arXiv (All)
• Degree-square Turán problem for two self-converse tournaments#1155982arXiv (All)
• Extension properties for partial permutations#1200521arXiv (All)
• Borel Kernels in Borel Directed Graphs#1247288arXiv (All)
• Extremal arborescences in graph orientations#1401077arXiv (All)
• Cayley Tournaments Simultaneously Critical for the Clique and Dichromatic Numbers#985991arXiv (All)
• CharacteriSations of Planar Galled Network#1076253arXiv (All)
• Quantitative Merino--Welsh inequalities for joins#1118753arXiv (All)
• Generating Functions and the Entropy Hierarchy of Strongly Connected Digraphs#1123701arXiv (OAI Expanded)
• Degree conditions for $k$-strong orientations of digraphs#1131752arXiv (All)
• Characterisations of Planar Galled Networks#1348938arXiv (OAI Expanded)
• Enumeration of small vertex-transitive directed strongly regular graphs#1387227arXiv (All)
• Proper 3-orientations of bipartite planar graphs with minimum degree at least 3#160766arXiv (OAI)
• Combinatorial games and the golden ratio on digraphs#617362arXiv (OAI Expanded)
• Combinatorial games and the golden ratio on digraphs#617862arXiv (All)
• Paths with Prescribed Endpoints in Semicomplete and Locally Semicomplete Digraphs#927425arXiv (All)
• Algebra of Path Integrals on Digraphs#971764arXiv (All)
• Automorphism groups of endomorphism monoids of $0$-unit $3$-valent circulant digraphs#1000276arXiv (All)
• A near-linear upper bound for Burr's conjecture#1011870arXiv (All)
• An Ore-type Theorem for Oriented Discrepancy of Hamilton Cycles#1049776arXiv (All)
• Hierarchical Clustering and Signal Denoising on Digraphs#1128929arXiv (All)
• Ramsey--Turán Factors of Non-directed Oriented Cycles in Oriented Graphs#920403arXiv (OAI Expanded)
• Ramsey--Turán Factors of Non-directed Oriented Cycles in Oriented Graphs#924635arXiv (All)
• An Exact Dominant Degree Condition for Transitive Tournament Factors in Digraphs#986319arXiv (All)