Image de couverture de livre

Almost all 9-regular graphs have a modulo-5 orientation

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Delcourt, Michelle, Huq, Reaz, Pralat, Pawel
Format:	Preprint
Publié:	2022
Sujets:	Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Hopping Forcing Number in Random $d$-regular Graphs
par: Pralat, Pawel, et autres
Publié: (2024)

Playing Sudoku on random 3-regular graphs
par: Dippel, Jack, et autres
Publié: (2025)

Almost all $C_k$-free oriented graphs have $Θ(n)$ backwards edges
par: Liu, Jianxi, et autres
Publié: (2026)

Decomposing random regular graphs into stars
par: Delcourt, Michelle, et autres
Publié: (2023)

Canonical labelling of random regular graphs
par: Isaev, Mikhail, et autres
Publié: (2026)

Multiset Metric Dimension of Binomial Random Graphs
par: Eide, Austin, et autres
Publié: (2025)

Almost all cographs have a cospectral mate
par: Wang, Wei, et autres
Publié: (2025)

Almost all standard double covers of abelian Cayley graphs have smallest possible automorphism groups
par: Xia, Binzhou, et autres
Publié: (2026)

Creating Subgraphs in Semi-Random Hypergraph Games
par: Behague, Natalie, et autres
Publié: (2024)

Almost all graphs have no cospectral mate with fixed level
par: Wang, Wei, et autres
Publié: (2025)

Burning Random Trees
par: Devroye, Luc, et autres
Publié: (2024)

Direct Paths in the Temporal Hypercube
par: Eide, Austin, et autres
Publié: (2025)

Asynchronous Majority Dynamics on Binomial Random Graphs
par: Mohan, Divyarthi, et autres
Publié: (2023)

Perfect matchings and loose Hamilton cycles in the semirandom hypergraph model
par: Molloy, Michael, et autres
Publié: (2023)

Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
par: Gamarnik, David, et autres
Publié: (2023)

Jaeger-type orientations of random regular graphs
par: Greenhill, Catherine, et autres
Publié: (2026)

Refined Absorption: A New Proof of the Existence Conjecture
par: Delcourt, Michelle, et autres
Publié: (2024)

Proof of the High Girth Existence Conjecture via Refined Absorption
par: Delcourt, Michelle, et autres
Publié: (2024)

Achievable Burning Densities of Growing Grids
par: Barrett, Jordan, et autres
Publié: (2026)

A Direct Proof of the Short-Side Advantage in Random Matching Markets
par: Mauras, Simon, et autres
Publié: (2025)

Almost all graphs have no cospectral mates with height relative small to its order
par: Zhao, Da
Publié: (2026)

Hitting all longest paths in $H$-free graphs and $H$-graphs
par: de Lima, Paloma T., et autres
Publié: (2025)

Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs
par: Behague, Natalie C., et autres
Publié: (2021)

Reducing Linear Hadwiger's Conjecture to Coloring Small Graphs
par: Delcourt, Michelle, et autres
Publié: (2021)

A Pragmatic Method for Comparing Clusterings with Overlaps and Outliers
par: DeWolfe, Ryan, et autres
Publié: (2026)

On the unicyclic graphs having vertices that belong to all their (strong) metric bases
par: Hakanen, Anni, et autres
Publié: (2022)

Counting the minimum number of arcs in an oriented graph having weak diameter 2
par: Das, Sandip, et autres
Publié: (2023)

Counting simplicial pairs in hypergraphs
par: Barrett, Jordan, et autres
Publié: (2024)

The net-regular strongly regular signed graphs with degree 5
par: Yu, Qian, et autres
Publié: (2025)

A Short Proof of the Existence of $K_q^r$-absorbers
par: Delcourt, Michelle, et autres
Publié: (2024)

Fractional Clique Decompositions of Dense Hypergraphs
par: Delcourt, Michelle, et autres
Publié: (2025)

On graphs without cycles of length 1 modulo 3
par: Bai, Yandong, et autres
Publié: (2025)

Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2n$ Rounds
par: Frieze, Alan, et autres
Publié: (2023)

A characterization of regular partial cubes whose all convex cycles have the same lengths
par: Xie, Yan-Ting, et autres
Publié: (2023)

The strongly regular twisted $D_{5,5}(q)$ graph
par: Ihringer, Ferdinand
Publié: (2023)

Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
par: Delcourt, Michelle, et autres
Publié: (2022)

Almost colour-balanced spanning forests in complete graphs
par: Hollom, Lawrence, et autres
Publié: (2024)

Antipaths in oriented graphs
par: Klimošová, Tereza, et autres
Publié: (2022)

Almost all graphs are vertex-minor universal
par: Ascoli, Ruben, et autres
Publié: (2026)

Clique Decompositions in Random Graphs via Refined Absorption
par: Delcourt, Michelle, et autres
Publié: (2024)