Extending Wormald's Differential Equation Method to One-sided Bounds
Fuente:
arXiv
Saved in:
| Main Authors: | Bennett, Patrick, MacRury, Calum |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Online Bipartite Matching in the Probe-Commit Model
by: Borodin, Allan, et al.
Published: (2023)
by: Borodin, Allan, et al.
Published: (2023)
Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
by: Ma, Will, et al.
Published: (2024)
by: Ma, Will, et al.
Published: (2024)
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
by: MacRury, Calum, et al.
Published: (2022)
by: MacRury, Calum, et al.
Published: (2022)
Dyck Paths Enumerated by the Q-bonacci Numbers
by: Barcucci, Elena, et al.
Published: (2024)
by: Barcucci, Elena, et al.
Published: (2024)
On The Roots of Independence Polynomial: Quantifying The Gap
by: Prakash, Om, et al.
Published: (2025)
by: Prakash, Om, et al.
Published: (2025)
A Bijection between Stacked Directed Polyominoes and Motzkin Paths with Alternative Catastrophes
by: Schager, Florian, et al.
Published: (2024)
by: Schager, Florian, et al.
Published: (2024)
Binary Words Containing Few Abelian Squares
by: Fazekas, Szilard Zsolt, et al.
Published: (2026)
by: Fazekas, Szilard Zsolt, et al.
Published: (2026)
The Converse of the Real Orthogonal Holant Theorem
by: Young, Ben
Published: (2024)
by: Young, Ben
Published: (2024)
Forward-backward Contention Resolution Schemes for Fair Rationing
by: Ma, Will, et al.
Published: (2025)
by: Ma, Will, et al.
Published: (2025)
An Improved Lower Bound on the Number of Pseudoline Arrangements
by: Kühnast, Fernando Cortés, et al.
Published: (2024)
by: Kühnast, Fernando Cortés, et al.
Published: (2024)
Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
by: Cavallaro, Dario, et al.
Published: (2026)
by: Cavallaro, Dario, et al.
Published: (2026)
Breaking the Symmetries of Amenable Graphs
by: Cheng, Christine T.
Published: (2025)
by: Cheng, Christine T.
Published: (2025)
Natural Measures on Polyominoes Induced by the Abelian Sandpile Model
by: Sportiello, Andrea
Published: (2024)
by: Sportiello, Andrea
Published: (2024)
Erdős Matching (Conjecture) Theorem
by: Mishra, Tapas Kumar
Published: (2026)
by: Mishra, Tapas Kumar
Published: (2026)
Slow Convergence of Ising and Spin Glass Models with Well-Separated Frustrated Vertices
by: Gillman, David, et al.
Published: (2026)
by: Gillman, David, et al.
Published: (2026)
New Results on Edge-coloring and Total-coloring of Split Graphs
by: Couto, Fernanda, et al.
Published: (2023)
by: Couto, Fernanda, et al.
Published: (2023)
Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
by: Adamson, Duncan, et al.
Published: (2023)
by: Adamson, Duncan, et al.
Published: (2023)
Monotonically Decreasing the Number of Directed 3-Cycles via Edge-Flips?
by: Bom, David, et al.
Published: (2025)
by: Bom, David, et al.
Published: (2025)
On the Metric Dimension of $K_a \times K_b \times K_c$
by: Gledel, Valentin, et al.
Published: (2024)
by: Gledel, Valentin, et al.
Published: (2024)
SSD Set System, Graph Decomposition and Hamiltonian Cycle
by: Shota, Kan, et al.
Published: (2024)
by: Shota, Kan, et al.
Published: (2024)
Locked Polyomino Tilings
by: Tucker-Foltz, Jamie
Published: (2023)
by: Tucker-Foltz, Jamie
Published: (2023)
Solving Maker-Breaker Games on 5-uniform hypergraphs is PSPACE-complete
by: Koepke, Finn Orson
Published: (2025)
by: Koepke, Finn Orson
Published: (2025)
The Hierarchy of Saturating Matching Numbers
by: Simon, Hans U., et al.
Published: (2025)
by: Simon, Hans U., et al.
Published: (2025)
Almost optimum $\ell$-covering of $\mathbb{Z}_n$
by: Shi, Ke, et al.
Published: (2022)
by: Shi, Ke, et al.
Published: (2022)
Constructions, bounds, and algorithms for peaceable queens
by: Clinch, Katie, et al.
Published: (2024)
by: Clinch, Katie, et al.
Published: (2024)
WELLDOC property for words generated by morphisms
by: Puzynina, Svetlana, et al.
Published: (2026)
by: Puzynina, Svetlana, et al.
Published: (2026)
Fibonacci and Lucas Sequences in Aperiodic Monotile Supertiles
by: Dong, Shiying
Published: (2024)
by: Dong, Shiying
Published: (2024)
The Polymatroid Representation of a Greedoid, and Associated Galois Connections
by: Streit, Robert P., et al.
Published: (2024)
by: Streit, Robert P., et al.
Published: (2024)
Bounds on the genus for 2-cell embeddings of prefix-reversal graphs
by: Blanco, Saúl A., et al.
Published: (2023)
by: Blanco, Saúl A., et al.
Published: (2023)
Explicit two-sided unique-neighbor expanders
by: Hsieh, Jun-Ting, et al.
Published: (2023)
by: Hsieh, Jun-Ting, et al.
Published: (2023)
Quantitative Edge Eigenvector Universality for Random Regular Graphs: Berry-Esseen Bounds with Explicit Constants
by: Nagel, Leonhard
Published: (2025)
by: Nagel, Leonhard
Published: (2025)
The Phase Transition of Discrepancy in Random Hypergraphs
by: MacRury, Calum, et al.
Published: (2021)
by: MacRury, Calum, et al.
Published: (2021)
On the Importance of Studying the Membership Problem for Pedigree Polytopes
by: Arthanari, Tiru
Published: (2025)
by: Arthanari, Tiru
Published: (2025)
Reduction of the graph isomorphism problem to equality checking of $n$-variables polynomials and the algorithms that use the reduction
by: Prolubnikov, Alexander
Published: (2015)
by: Prolubnikov, Alexander
Published: (2015)
Pattern Avoidance for Fibonacci Sequences using $k$-Regular Words
by: Downing, Emily, et al.
Published: (2023)
by: Downing, Emily, et al.
Published: (2023)
Improved Upper Bounds for Slicing the Hypercube
by: Soiffer, Duncan, et al.
Published: (2026)
by: Soiffer, Duncan, et al.
Published: (2026)
Morphic Sequences: Complexity and Decidability
by: Henry, Raphael
Published: (2024)
by: Henry, Raphael
Published: (2024)
Robot Positioning Using Torus Packing for Multisets
by: Chen, Chung Shue, et al.
Published: (2024)
by: Chen, Chung Shue, et al.
Published: (2024)
Vanishing Signatures, Orbit Closure, and the Converse of the Holant Theorem
by: Cai, Jin-Yi, et al.
Published: (2025)
by: Cai, Jin-Yi, et al.
Published: (2025)
A first efficient algorithm for enumerating all the extreme points of a bisubmodular polyhedron
by: Matsui, Yasuko, et al.
Published: (2024)
by: Matsui, Yasuko, et al.
Published: (2024)
Similar Items
-
Online Bipartite Matching in the Probe-Commit Model
by: Borodin, Allan, et al.
Published: (2023) -
Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
by: Ma, Will, et al.
Published: (2024) -
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
by: MacRury, Calum, et al.
Published: (2022) -
Dyck Paths Enumerated by the Q-bonacci Numbers
by: Barcucci, Elena, et al.
Published: (2024) -
On The Roots of Independence Polynomial: Quantifying The Gap
by: Prakash, Om, et al.
Published: (2025)