The classification of homomorphism homogeneous oriented graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Pavlica, Bojana, Pech, Christian, Pech, Maja |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Monoid algebras and graph products
by: Imrich, Wilfried, et al.
Published: (2024)
by: Imrich, Wilfried, et al.
Published: (2024)
All graphs are majority 3-choosable
by: Ouborny, Jan, et al.
Published: (2025)
by: Ouborny, Jan, et al.
Published: (2025)
Distinguishing colorings, proper colorings, and covering properties without the Axiom of Choice
by: Banerjee, Amitayu, et al.
Published: (2023)
by: Banerjee, Amitayu, et al.
Published: (2023)
Adversarial graph burning densities
by: Gunderson, Karen, et al.
Published: (2022)
by: Gunderson, Karen, et al.
Published: (2022)
Universal families of rayless graphs
by: Aurichi, Leandro Fiorini, et al.
Published: (2025)
by: Aurichi, Leandro Fiorini, et al.
Published: (2025)
Borel Combinatorics of Abelian Group Actions
by: Gao, Su, et al.
Published: (2024)
by: Gao, Su, et al.
Published: (2024)
Alternating paths in oriented graphs with large semidegree
by: Skokan, Jozef, et al.
Published: (2024)
by: Skokan, Jozef, et al.
Published: (2024)
A note on uncountably chromatic graphs
by: Bowler, Nathan, et al.
Published: (2024)
by: Bowler, Nathan, et al.
Published: (2024)
On orientations preserving edge-connectivity in infinite graphs
by: Aurichi, Leandro, et al.
Published: (2025)
by: Aurichi, Leandro, et al.
Published: (2025)
The Nash-Williams orientation theorem for graphs with countably many ends
by: Assem, Amena, et al.
Published: (2023)
by: Assem, Amena, et al.
Published: (2023)
Seymour-tight orientations
by: Guo, Krystal, et al.
Published: (2026)
by: Guo, Krystal, et al.
Published: (2026)
Ubiquity of oriented rays
by: Gut, Florian, et al.
Published: (2022)
by: Gut, Florian, et al.
Published: (2022)
On the ubiquity of oriented double rays
by: Gut, Florian, et al.
Published: (2023)
by: Gut, Florian, et al.
Published: (2023)
Borel Kernels in Borel Directed Graphs
by: Wang, Ruijun
Published: (2025)
by: Wang, Ruijun
Published: (2025)
Efficiently distinguishing all tangles in locally finite graphs
by: Jacobs, Raphael W., et al.
Published: (2023)
by: Jacobs, Raphael W., et al.
Published: (2023)
Trees of tangles in infinite separation systems
by: Elbracht, Christian, et al.
Published: (2020)
by: Elbracht, Christian, et al.
Published: (2020)
On the Possibilities of Defining Infinite Oriented Matroids
by: Bowler, Nathan, et al.
Published: (2026)
by: Bowler, Nathan, et al.
Published: (2026)
A very short proof of Sidorenko's inequality for counts of homomorphism between graphs
by: Lüchtrath, Lukas, et al.
Published: (2024)
by: Lüchtrath, Lukas, et al.
Published: (2024)
Cutting a Pancake with an Exotic Knife
by: Cutler, David O. H., et al.
Published: (2025)
by: Cutler, David O. H., et al.
Published: (2025)
Towards a dichotomy for the switch list homomorphism problem for signed graphs
by: Kim, Hyobin, et al.
Published: (2021)
by: Kim, Hyobin, et al.
Published: (2021)
Pseudofiniteness and measurability of the everywhere infinite forest
by: García, Darío, et al.
Published: (2023)
by: García, Darío, et al.
Published: (2023)
Elusive properties of countably infinite graphs
by: Elekes, Márton, et al.
Published: (2025)
by: Elekes, Márton, et al.
Published: (2025)
An oriented discrepancy version of Dirac's theorem
by: Freschi, Andrea, et al.
Published: (2022)
by: Freschi, Andrea, et al.
Published: (2022)
Catalan number sequences and generalized action graphs
by: Caldwell, Drew, et al.
Published: (2025)
by: Caldwell, Drew, et al.
Published: (2025)
On better-quasi-ordering under graph minors
by: Georgakopoulos, Agelos
Published: (2025)
by: Georgakopoulos, Agelos
Published: (2025)
The random ordered graph is a semi-retract of the canonically ordered atomless Boolean algebra
by: Pinsker, Michael, et al.
Published: (2025)
by: Pinsker, Michael, et al.
Published: (2025)
Fully Leafed Induced Subtrees in Penrose P2 Tilings
by: Cloutier, Mathieu, et al.
Published: (2026)
by: Cloutier, Mathieu, et al.
Published: (2026)
Penrose P2 Tilings: A Study of Fully Leafed Induced Subtrees
by: Cloutier, Mathieu, et al.
Published: (2026)
by: Cloutier, Mathieu, et al.
Published: (2026)
On directed and undirected diameters of vertex-transitive graphs
by: Skresanov, Saveliy V.
Published: (2023)
by: Skresanov, Saveliy V.
Published: (2023)
Brooks' type theorems for coloring parameters of locally finite graphs and Konig's Lemma
by: Banerjee, Amitayu, et al.
Published: (2024)
by: Banerjee, Amitayu, et al.
Published: (2024)
Finding automorphism groups of double coset graphs and Cayley graphs are equivalent
by: Barber, Rachel, et al.
Published: (2024)
by: Barber, Rachel, et al.
Published: (2024)
On Interactions for Large Scale Interacting Systems
by: Bannai, Kenichi, et al.
Published: (2024)
by: Bannai, Kenichi, et al.
Published: (2024)
On ends of degree $ω_1$
by: Aurichi, Leandro, et al.
Published: (2024)
by: Aurichi, Leandro, et al.
Published: (2024)
Orientations of cycles in digraphs of high chromatic number and high minimum out-degree
by: Koerts, Hidde, et al.
Published: (2025)
by: Koerts, Hidde, et al.
Published: (2025)
Cofinality of Regular Tournaments
by: Hatem, Omar, et al.
Published: (2026)
by: Hatem, Omar, et al.
Published: (2026)
Hamilton Powers of Eulerian Digraphs
by: Colón, Enrico Celestino, et al.
Published: (2022)
by: Colón, Enrico Celestino, et al.
Published: (2022)
Spectral Bounds for Directed Graphs Via Asymmetric Matrices: Applications to Toughness
by: Carter, Rebecca
Published: (2025)
by: Carter, Rebecca
Published: (2025)
A note on the structure of locally finite planar quasi-transitive graphs
by: Giocanti, Ugo
Published: (2024)
by: Giocanti, Ugo
Published: (2024)
An end degree for digraphs
by: Hamann, Matthias, et al.
Published: (2024)
by: Hamann, Matthias, et al.
Published: (2024)
Normal trees of digraphs
by: Reich, Florian
Published: (2024)
by: Reich, Florian
Published: (2024)
Similar Items
-
Monoid algebras and graph products
by: Imrich, Wilfried, et al.
Published: (2024) -
All graphs are majority 3-choosable
by: Ouborny, Jan, et al.
Published: (2025) -
Distinguishing colorings, proper colorings, and covering properties without the Axiom of Choice
by: Banerjee, Amitayu, et al.
Published: (2023) -
Adversarial graph burning densities
by: Gunderson, Karen, et al.
Published: (2022) -
Universal families of rayless graphs
by: Aurichi, Leandro Fiorini, et al.
Published: (2025)