Image de couverture de livre

Probabilistic Methods on Erdos Problems

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Gilbert, Jesse
Format:	Preprint
Publié:	2011
Sujets:	Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Graph Theory
par: Gilbert, Jesse D.
Publié: (2011)

Multi-Agent Search-Type Problems on Polygons
par: Georgiou, Konstantinos, et autres
Publié: (2024)

Balanced colorings of Erdős-Rényi hypergraphs
par: Dhawan, Abhishek, et autres
Publié: (2025)

Chemically inspired Erdős-Rényi oriented hypergraphs
par: Garcia-Chung, Angel, et autres
Publié: (2023)

Erdős-Pósa property of tripods in directed graphs
par: Briański, Marcin, et autres
Publié: (2024)

Erdős--Pósa property of cycles that are far apart
par: Dujmović, Vida, et autres
Publié: (2024)

Tight bound for the Erdős-Pósa property of tree minors
par: Dujmović, Vida, et autres
Publié: (2024)

Half-integral Erdős-Pósa property for non-null $S$-$T$ paths
par: Chekan, Vera, et autres
Publié: (2024)

Vertex-Based Localization of Erdős-Gallai Theorems for Paths and Cycles
par: Adak, Rajat, et autres
Publié: (2025)

The EnvDesign Model: A Method to Solve the Environment Design Problem
par: Sathiya, Akshay, et autres
Publié: (2024)

Splitting vertices of bipartite graphs preserves de Bruijn-Erdős property
par: Beaudou, Laurent, et autres
Publié: (2025)

A complete solution of the Erdős-Kleitman matching problem for $n\le 3s$
par: Kupavskii, Andrey, et autres
Publié: (2025)

Linear Search with Probabilistic Detection and Variable Speeds
par: Coleman, Jared, et autres
Publié: (2025)

Asymptotic Tightness of the Pigeonhole Bound for Large-Order Davenport-Schinzel Sequences
par: Geneson, Jesse
Publié: (2026)

Hierarchy of Hub Covering Problems
par: Jost, Niklas
Publié: (2025)

Algorithms for the Global Domination Problem
par: Inza, Ernesto Parra, et autres
Publié: (2023)

The Fagnano Triangle Patrolling Problem
par: Georgiou, Konstantinos, et autres
Publié: (2023)

Fault tolerance for metric dimension and its variants
par: Geneson, Jesse, et autres
Publié: (2025)

The Unreliable Job Selection and Sequencing Problem
par: Agnetis, Alessandro, et autres
Publié: (2025)

On the Hardness of Gray Code Problems for Combinatorial Objects
par: Merino, Arturo, et autres
Publié: (2024)

Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem
par: Dubinsky, Manuel, et autres
Publié: (2024)

Short Proof: Exact Solution to the Finite Frobenius Coin Problem
par: De Gaspari, Lorenzo, et autres
Publié: (2025)

A Scalable Lift-and-Project Differentiable Approach For the Maximum Cut Problem
par: Alkhouri, Ismail, et autres
Publié: (2025)

The Labeled Coupon Collector Problem with Random Sample Sizes and Partial Recovery
par: Berrebi, Shoham Shimon, et autres
Publié: (2025)

A Decomposition Method for the Hybrid Quantum-Classical Solution of the Number Partitioning Problem
par: Li, Zongji, et autres
Publié: (2023)

Probabilistic Interval Analysis of Unreliable Programs
par: Das, Dibyendu, et autres
Publié: (2024)

The Freight Multimodal Transport Problem with Buses and Drones: An Integrated Approach for Last-Mile Delivery
par: Su, E, et autres
Publié: (2025)

The Bottleneck Birthday Problem
par: Tripathy, Chijul B.
Publié: (2025)

The Storage Location Assignment and Picker Routing Problem: A Generic Branch-Cut-and-Price Algorithm
par: Prunet, Thibault, et autres
Publié: (2024)

Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems
par: Hirahara, Shuichi, et autres
Publié: (2023)

Stable non-minimal fixed points of threshold-linear networks
par: Geneson, Jesse
Publié: (2025)

A Method to Generate Multi-interval Pairwise Compatibility Graphs
par: Hayat, Seemab, et autres
Publié: (2024)

A Method for Generating Connected Erdos-Renyi Random Graphs
par: Chinyaev, Boris
Publié: (2025)

On a Problem of Ramsey Theory
par: Frasser, Carlos E.
Publié: (2024)

The Rainbow Arborescence Problem on Cycles
par: Bérczi, Kristóf, et autres
Publié: (2025)

The Careless Coupon Collector's Problem
par: Cruciani, Emilio, et autres
Publié: (2026)

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
par: Tellache, Nour ElHouda, et autres
Publié: (2025)

Improving Performance in Combinatorial Optimization Problems with Inequality Constraints: An Evaluation of the Unbalanced Penalization Method on D-Wave Advantage
par: Montanez-Barrera, J. A., et autres
Publié: (2023)

Contradiction Graphs Determine VC Dimension
par: Campbell, Jesse, et autres
Publié: (2026)

An Explicit Formula for Vertex Enumeration in the CUT(n) Polytope via Probabilistic Methods
par: Marić, Nevena
Publié: (2025)