Acyclic sets in -majority tournaments.
Milans, Kevin G., Schreiber, Daniel H., West, Douglas B. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Milans, Kevin G., Schreiber, Daniel H., West, Douglas B. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Groemer, H., Wallen, L.J. (2001)
Beiträge zur Algebra und Geometrie
Similarity:
Ewald, Günter (2001)
Beiträge zur Algebra und Geometrie
Similarity:
Dohmen, Klaus, Tittmann, Peter (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
d'Azevedo Breda, A.M., Ribeiro, Patrícia S., Santos, Altino F. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Keevash, Peter, Loh, Po-Shen, Sudakov, Benny (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Zoran Stanić (2005)
Kragujevac Journal of Mathematics
Similarity:
D'Azevedo Breda, A.M., Ribeiro, Patrícia S., Santos, Altino F. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dragomir, Sever Silvestru, Goh, C.J. (1997)
Journal of Inequalities and Applications [electronic only]
Similarity:
Viktor Harangi (2011)
Open Mathematics
Similarity:
We say that a set in a Euclidean space does not contain an angle α if the angle determined by any three points of the set is not equal to α. The goal of this paper is to construct compact sets of large Hausdorff dimension that do not contain a given angle α ∈ (0,π). We will construct such sets in ℝn of Hausdorff dimension c(α)n with a positive c(α) depending only on α provided that α is different from π/3, π/2 and 2π/3. This improves on an earlier construction (due to several authors)...
Wancang Ma, David Minda (1993)
Annales Polonici Mathematici
Similarity:
Recently, A. W. Goodman introduced the class UCV of normalized uniformly convex functions. We present some sharp coefficient bounds for functions f(z) = z + a₂z² + a₃z³ + ... ∈ UCV and their inverses . The series expansion for converges when , where depends on f. The sharp bounds on and all extremal functions were known for n = 2 and 3; the extremal functions consist of a certain function k ∈ UCV and its rotations. We obtain the sharp bounds on and all extremal functions for...
Hegarty, Peter, Larsson, Urban (2006)
Integers
Similarity:
T. Karthick, C.R. Subramanian (2013)
Discussiones Mathematicae Graph Theory
Similarity:
A star coloring of an undirected graph G is a coloring of the vertices of G such that (i) no two adjacent vertices receive the same color, and (ii) no path on 4 vertices is bi-colored. The star chromatic number of G, χs(G), is the minimum number of colors needed to star color G. In this paper, we show that if a graph G is either non-regular subcubic or cubic with girth at least 6, then χs(G) ≤ 6, and the bound can be realized in linear time.