Cover Image

Probabilistic Methods on Erdos Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Gilbert, Jesse
Format:	Preprint
Published:	2011
Subjects:	Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Graph Theory
by: Gilbert, Jesse D.
Published: (2011)

Multi-Agent Search-Type Problems on Polygons
by: Georgiou, Konstantinos, et al.
Published: (2024)

Balanced colorings of Erdős-Rényi hypergraphs
by: Dhawan, Abhishek, et al.
Published: (2025)

Chemically inspired Erdős-Rényi oriented hypergraphs
by: Garcia-Chung, Angel, et al.
Published: (2023)

Erdős-Pósa property of tripods in directed graphs
by: Briański, Marcin, et al.
Published: (2024)

Erdős--Pósa property of cycles that are far apart
by: Dujmović, Vida, et al.
Published: (2024)

Tight bound for the Erdős-Pósa property of tree minors
by: Dujmović, Vida, et al.
Published: (2024)

Half-integral Erdős-Pósa property for non-null $S$-$T$ paths
by: Chekan, Vera, et al.
Published: (2024)

Vertex-Based Localization of Erdős-Gallai Theorems for Paths and Cycles
by: Adak, Rajat, et al.
Published: (2025)

The EnvDesign Model: A Method to Solve the Environment Design Problem
by: Sathiya, Akshay, et al.
Published: (2024)

Splitting vertices of bipartite graphs preserves de Bruijn-Erdős property
by: Beaudou, Laurent, et al.
Published: (2025)

A complete solution of the Erdős-Kleitman matching problem for $n\le 3s$
by: Kupavskii, Andrey, et al.
Published: (2025)

Linear Search with Probabilistic Detection and Variable Speeds
by: Coleman, Jared, et al.
Published: (2025)

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

Hierarchy of Hub Covering Problems
by: Jost, Niklas
Published: (2025)

Algorithms for the Global Domination Problem
by: Inza, Ernesto Parra, et al.
Published: (2023)

The Fagnano Triangle Patrolling Problem
by: Georgiou, Konstantinos, et al.
Published: (2023)

Fault tolerance for metric dimension and its variants
by: Geneson, Jesse, et al.
Published: (2025)

The Unreliable Job Selection and Sequencing Problem
by: Agnetis, Alessandro, et al.
Published: (2025)

On the Hardness of Gray Code Problems for Combinatorial Objects
by: Merino, Arturo, et al.
Published: (2024)

Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem
by: Dubinsky, Manuel, et al.
Published: (2024)

Short Proof: Exact Solution to the Finite Frobenius Coin Problem
by: De Gaspari, Lorenzo, et al.
Published: (2025)

A Scalable Lift-and-Project Differentiable Approach For the Maximum Cut Problem
by: Alkhouri, Ismail, et al.
Published: (2025)

The Labeled Coupon Collector Problem with Random Sample Sizes and Partial Recovery
by: Berrebi, Shoham Shimon, et al.
Published: (2025)

A Decomposition Method for the Hybrid Quantum-Classical Solution of the Number Partitioning Problem
by: Li, Zongji, et al.
Published: (2023)

Probabilistic Interval Analysis of Unreliable Programs
by: Das, Dibyendu, et al.
Published: (2024)

The Freight Multimodal Transport Problem with Buses and Drones: An Integrated Approach for Last-Mile Delivery
by: Su, E, et al.
Published: (2025)

The Bottleneck Birthday Problem
by: Tripathy, Chijul B.
Published: (2025)

The Storage Location Assignment and Picker Routing Problem: A Generic Branch-Cut-and-Price Algorithm
by: Prunet, Thibault, et al.
Published: (2024)

Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems
by: Hirahara, Shuichi, et al.
Published: (2023)

Stable non-minimal fixed points of threshold-linear networks
by: Geneson, Jesse
Published: (2025)

A Method to Generate Multi-interval Pairwise Compatibility Graphs
by: Hayat, Seemab, et al.
Published: (2024)

A Method for Generating Connected Erdos-Renyi Random Graphs
by: Chinyaev, Boris
Published: (2025)

On a Problem of Ramsey Theory
by: Frasser, Carlos E.
Published: (2024)

The Rainbow Arborescence Problem on Cycles
by: Bérczi, Kristóf, et al.
Published: (2025)

The Careless Coupon Collector's Problem
by: Cruciani, Emilio, et al.
Published: (2026)

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
by: Tellache, Nour ElHouda, et al.
Published: (2025)

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

Contradiction Graphs Determine VC Dimension
by: Campbell, Jesse, et al.
Published: (2026)

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