Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1107.3279

Probabilistic Methods on Erdos Problems

Jesse Gilbert
View original source ↗Read source document ↗Export metadata ↓

Abstract

Probability distributions and the rules of inclusion-exclusion apply to derive general results about graph theory and number theory. In order to apply the rules of inclusion-exclusion in the setting some of these problems require, it is necessary to use specific equations and make several assumptions about integration and measure of the probability distributions.

Explore related subjects

cs.DM

Keep this discovery

BibTeXRIS

Jesse Gilbert. 2026-08-31. Probabilistic Methods on Erdos Problems. https://arxiv.org/abs/1107.3279

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.DM subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

It's Hard to PArcK

We show that Partizan Arc Kayles (PArcK), a generalization of Domineering to graphs, is PSPACE-complete via a reduction from Positive CNF and with recently-discovered techniques for creating PArcK positions with high temperature. The reduction uses only red and blue edges.

cs.CC↗
arXiv2026

An Improved Bound for Smith's Longest Cycles Conjecture via a Forbidden Subdivision

Smith's conjecture asserts that in every $k$-connected graph with $k\geq 2$, any two longest cycles intersect in at least $k$ vertices. In this work, we establish an $Ω(k^{8/11})$ bound for this conjecture, improving upon the $Ω(k^{2/3})$ bound of Ma and Zhao. Our proof combines a Ramsey theoretic refinement of the traditional Turán-type approach with computer search.

math.CO↗