#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2007

2015

- This year (0)
- Last 5 years (3)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Endre Csóka, Balázs Gerencsér, Viktor Harangi, Bálint Virág
- Random Struct. Algorithms
- 2015

We prove that every 3-regular, n-vertex simple graph with sufficiently large girth contains an independent set of size at least 0.4361n. (The best known bound is 0.4352n.) In fact, computer simulation suggests that the bound our method provides is about 0.438n. Our method uses invariant Gaussian processes on the d-regular tree that satisfy the eigenvector… (More)

- Viktor Harangi
- 2013

1.1. The independence ratio and the minimum eigenvalue. An independent set is a set of vertices in a graph, no two of which are adjacent. The independence ratio of a graph G is the size of its largest independent set divided by the total number of vertices. If G is regular, then the independence ratio is at most 1/2, and it is equal to 1/2 if and only if G… (More)

- Viktor Harangi
- SIAM J. Discrete Math.
- 2011

A finite set H in Rd is called an acute set if any angle determined by three points of H is acute. We examine the maximal cardinality α(d) of a d-dimensional acute set. The exact value of α(d) is known only for d ≤ 3. For each d ≥ 4 we improve on the best known lower bound for α(d). We present different approaches. On one hand, we give a probabilistic proof… (More)

- Viktor Harangi, Tamás Keleti, +4 authors Balázs Strenner
- 2010

We study the following two problems: (1) Given n ≥ 2 and α, how large Hausdorff dimension can a compact set A ⊂ R have if A does not contain three points that form an angle α? (2) Given α and δ, how large Hausdorff dimension can a compact subset A of a Euclidean space have if A does not contain three points that form an angle in the δ-neighborhood of α?… (More)

- Viktor Harangi
- Combinatorica
- 2013

The thesis addresses problems from the field of geometric measure theory. It turns out<lb>that discrete methods can be used efficiently to solve these problems. Let us summarize<lb>the main results of the thesis.<lb>In Chapter 2 we investigate the following question proposed by Tamás Keleti. How<lb>large (in terms of Hausdorff dimension) can a compact set A… (More)

- Viktor Harangi, Tamás Keleti, +4 authors Balázs Strenner
- 2011

We study the following two problems: (1) Given n ≥ 2 and α, how large Hausdorff dimension can a compact set A ⊂ R have if A does not contain three points that form an angle α? (2) Given α and δ, how large Hausdorff dimension can a compact subset A of a Euclidean space have if A does not contain three points that form an angle in the δ-neighborhood of α?… (More)

Consider a1, . . . , an ∈ R arbitrary elements. We characterize those functions f : R → R that decompose into the sum of aj-periodic functions, i.e., f = f1+· · ·+fn with ∆aj f(x) := f(x+aj)−f(x) = 0. We show that f has such a decomposition if and only if for all partitions B1∪B2∪· · ·∪BN = {a1, . . . , an} with Bj consisting of commensurable elements with… (More)

- ‹
- 1
- ›