Saved in:
| Main Authors: | Dukes, Mark, Sohn, Anton |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2311.12218 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Six Permutation Patterns Force Quasirandomness
by: Crudele, Gabriel, et al.
Published: (2023)
by: Crudele, Gabriel, et al.
Published: (2023)
Regular packing of rooted hyperforests with root constraints in hypergraphs
by: Hoppenot, Pierre, et al.
Published: (2023)
by: Hoppenot, Pierre, et al.
Published: (2023)
Neighbour sum distinguishing edge-weightings with local constraints
by: Dailly, Antoine, et al.
Published: (2022)
by: Dailly, Antoine, et al.
Published: (2022)
Note about the complexity of the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2025)
by: Gravier, Sylvain, et al.
Published: (2025)
Some polynomial classes for the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2026)
by: Gravier, Sylvain, et al.
Published: (2026)
A composition theory for upward planar orders
by: Dong, Xue, et al.
Published: (2025)
by: Dong, Xue, et al.
Published: (2025)
On a Characterization of Spartan Graphs
by: Misra, Neeldhara, et al.
Published: (2025)
by: Misra, Neeldhara, et al.
Published: (2025)
Characterization of Split Comparability Graphs
by: Dwary, Tithi, et al.
Published: (2025)
by: Dwary, Tithi, et al.
Published: (2025)
Cyclic ordering of split matroids
by: Bérczi, Kristóf, et al.
Published: (2024)
by: Bérczi, Kristóf, et al.
Published: (2024)
Characterizing Large Clique Number in Tournaments
by: Crew, Logan, et al.
Published: (2026)
by: Crew, Logan, et al.
Published: (2026)
Characterization of Word-Representable Near-Triangulations
by: Roy, Suchanda, et al.
Published: (2026)
by: Roy, Suchanda, et al.
Published: (2026)
Characterization of Double-Arborescences and their Minimum-Word-Representants
by: Dwary, Tithi, et al.
Published: (2024)
by: Dwary, Tithi, et al.
Published: (2024)
On the order-diameter ratio of girth-diameter cages
by: Cambie, Stijn, et al.
Published: (2025)
by: Cambie, Stijn, et al.
Published: (2025)
Subdivisions in dicritical digraphs with large order or digirth
by: Picasarri-Arrieta, Lucas, et al.
Published: (2024)
by: Picasarri-Arrieta, Lucas, et al.
Published: (2024)
Characterization of Word-Representable Graphs using Modular Decomposition
by: Dwary, Tithi, et al.
Published: (2024)
by: Dwary, Tithi, et al.
Published: (2024)
Characterizing and Transforming DAGs within the I-LCA Framework
by: Hellmuth, Marc, et al.
Published: (2024)
by: Hellmuth, Marc, et al.
Published: (2024)
Characterization of Circular-arc Graphs: III. Chordal Graphs
by: Cao, Yixin, et al.
Published: (2024)
by: Cao, Yixin, et al.
Published: (2024)
Tree decompositions with small width, spread, order and degree
by: Wood, David R.
Published: (2025)
by: Wood, David R.
Published: (2025)
List coloring ordered graphs with forbidden induced subgraphs
by: Piecyk, Marta, et al.
Published: (2025)
by: Piecyk, Marta, et al.
Published: (2025)
Computer-assisted graph theory: a survey
by: Jooken, Jorik
Published: (2025)
by: Jooken, Jorik
Published: (2025)
A Characterization of Geodetic Graphs in Terms of their Embedded Even Graphs
by: Frasser, Carlos E.
Published: (2026)
by: Frasser, Carlos E.
Published: (2026)
Characterization of Chordal Circular-arc Graphs: I. Split Graphs
by: Cao, Yixin, et al.
Published: (2024)
by: Cao, Yixin, et al.
Published: (2024)
Forbidden Induced Subgraph Characterization of Word-Representable Split Graphs
by: Srinivasan, Eshwar, et al.
Published: (2025)
by: Srinivasan, Eshwar, et al.
Published: (2025)
Forbidden Induced Subgraph Characterization of Word-Representable Co-bipartite Graphs
by: Srinivasan, Eshwar, et al.
Published: (2025)
by: Srinivasan, Eshwar, et al.
Published: (2025)
Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs
by: Pépin, Martin, et al.
Published: (2023)
by: Pépin, Martin, et al.
Published: (2023)
Inferring DAGs and Phylogenetic Networks from Least Common Ancestors
by: Lindeberg, Anna, et al.
Published: (2025)
by: Lindeberg, Anna, et al.
Published: (2025)
PHOEG: an online tool for discovery and education in extremal graph theory
by: Bonte, Sébastien, et al.
Published: (2026)
by: Bonte, Sébastien, et al.
Published: (2026)
Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
by: Meunier, Anthony, et al.
Published: (2026)
by: Meunier, Anthony, et al.
Published: (2026)
Characterizing optimal monitoring edge-geodetic sets for some structured graph classes
by: Foucaud, Florent, et al.
Published: (2025)
by: Foucaud, Florent, et al.
Published: (2025)
Planar induced paths via a decomposition into non-crossing ordered graphs
by: Duron, Julien, et al.
Published: (2025)
by: Duron, Julien, et al.
Published: (2025)
A bound for the cops and robber problem in terms of 2-component order connectivity
by: Jain, Suryaansh, et al.
Published: (2024)
by: Jain, Suryaansh, et al.
Published: (2024)
First-order logic axiomatization of metric graph theory
by: Chalopin, Jérémie, et al.
Published: (2022)
by: Chalopin, Jérémie, et al.
Published: (2022)
Minimum number of arcs in $k$-critical digraphs with order at most $2k-1$
by: Picasarri-Arrieta, Lucas, et al.
Published: (2023)
by: Picasarri-Arrieta, Lucas, et al.
Published: (2023)
Type-B analogue of Bell numbers using Rota's Umbral calculus approach
by: Bagno, Eli, et al.
Published: (2024)
by: Bagno, Eli, et al.
Published: (2024)
$k$-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for $k \geq 5$
by: la Tour, Max Dupré, et al.
Published: (2024)
by: la Tour, Max Dupré, et al.
Published: (2024)
Characterizations of monadically dependent tree-ordered weakly sparse structures
by: Buffière, Hector, et al.
Published: (2026)
by: Buffière, Hector, et al.
Published: (2026)
Sunflowers in set systems with small VC-dimension
by: Balogh, József, et al.
Published: (2024)
by: Balogh, József, et al.
Published: (2024)
Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
by: Lozin, Vadim, et al.
Published: (2022)
by: Lozin, Vadim, et al.
Published: (2022)
The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes
by: Tiskin, Alexander
Published: (2022)
by: Tiskin, Alexander
Published: (2022)
A sharp version of Talagrand's selector process conjecture and an application to rounding fractional covers
by: Pham, Huy Tuan
Published: (2024)
by: Pham, Huy Tuan
Published: (2024)
Similar Items
-
Six Permutation Patterns Force Quasirandomness
by: Crudele, Gabriel, et al.
Published: (2023) -
Regular packing of rooted hyperforests with root constraints in hypergraphs
by: Hoppenot, Pierre, et al.
Published: (2023) -
Neighbour sum distinguishing edge-weightings with local constraints
by: Dailly, Antoine, et al.
Published: (2022) -
Note about the complexity of the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2025) -
Some polynomial classes for the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2026)