Results 331 to 340 of about 338,180 (367)

On the conjecture of hajós

Combinatorica, 1981
\textit{G.Hajós} [Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg, Math.-Naturw. Reihe 10, 113-117 (1961; Zbl 0094.17602), pp. 116-117] conjectured that every \(s\)-chromatic graph contains a subdivision of \(K_s\), the complete graph on \(s\) vertices. This conjecture was disproved ins a paper by \textit{P.A.Catlin} [J. Comb. Theory, Ser. B 26, 268-274 (
Paul Erdös, Siemion Fajtlowicz
openaire   +1 more source

On a Conjecture of Kemnitz

Combinatorica, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On Carmichael's Conjecture

Proceedings of the American Mathematical Society, 1974
A sufficient condition is given for a natural number x x in order that the equation
openaire   +1 more source

On the Alspach Conjecture

Combinatorics, Probability and Computing, 2001
It has been conjectured by Alspach [2] that given integers n and m1, …, mt with 3 [les ] mi [les ] n and [sum ]ti=1mi = (n2) (n odd) or [sum ]ti=1mi = (n2) − n/2 (n even), then one can pack Kn (n odd) or Kn minus a 1-factor (n even) with cycles of lengths m1, …, mt. In this paper we show that if the cycle lengths mi are bounded
openaire   +2 more sources

Jaeger's Conjecture

Combinatorics, Probability and Computing, 2006
The problem we consider here is based on the following question posed by François Jaeger in 1981 at a combinatorics meeting in Eger (Hungary):
openaire   +1 more source

Edgeworth's Conjecture

Econometrica, 1973
We study the properties of the core of large markets. We assume that traders' preferences have certain standard properties, that their preferences belong to a set which is compact with respect to a certain topology, and that there is a bound on their initial endowments.
openaire   +1 more source

On the Thomassen's conjecture*

Journal of Graph Theory, 2001
AbstractC. Thomassen proposed a conjecture: Let G be a k‐connected graph with the stability number α ≥ k, then G has a cycle C containing k independent vertices and all their neighbors. In this paper, we will obtain the following result: Let G be a k‐connected graph with stability number α = k + 3 and C any longest cycle of G, then C contains k ...
openaire   +1 more source

Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services

SIGA, 2002
Seth Gilbert, N. Lynch
semanticscholar   +1 more source

On the factorization conjecture

1992
We construct a family of finite maximal codes over the alphabet {a, b} which verify the factorization conjecture on codes proposed by Schutzenberger. This family contains any finite maximal code with at most three occurrences of the letter b by word.
openaire   +2 more sources

La conjecture de Weil. I

, 1974
P. Deligne
semanticscholar   +1 more source