1997
DOI: 10.1016/s0012-365x(96)00184-7
|View full text |Cite
|
Sign up to set email alerts
|

C6-free bipartite graphs and product representation of squares

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

3
54
0

Year Published

1997
1997
2021
2021

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 41 publications
(58 citation statements)
references
References 2 publications
3
54
0
Order By: Relevance
“…For instance, for k=3 we show that π(n)+π(n/2)+cn 2/3 (log n) 4/3 ≤ G 3 (n)≤π(n)+π(n/2)+cn 2/3 (log n)/(loglog n), and for k=4 π(n)+n 3/5 / (log n) 6/5 ≤G 4 (n)≤π(n)+cn 2/3 (where π(x) denotes the number of primes up to x). These results strengthen some results of Erdős, Sárközy, T. Sós [137] and Győri [139] concerning a strongly related problem from combinatorial number theory: How many elements of the set {1, 2, ..., n} can be chosen in such a way that none of the 2k-factor products from this set is a perfect square?…”
Section: Further Combinatorial Resultssupporting
confidence: 84%
“…For instance, for k=3 we show that π(n)+π(n/2)+cn 2/3 (log n) 4/3 ≤ G 3 (n)≤π(n)+π(n/2)+cn 2/3 (log n)/(loglog n), and for k=4 π(n)+n 3/5 / (log n) 6/5 ≤G 4 (n)≤π(n)+cn 2/3 (where π(x) denotes the number of primes up to x). These results strengthen some results of Erdős, Sárközy, T. Sós [137] and Győri [139] concerning a strongly related problem from combinatorial number theory: How many elements of the set {1, 2, ..., n} can be chosen in such a way that none of the 2k-factor products from this set is a perfect square?…”
Section: Further Combinatorial Resultssupporting
confidence: 84%
“…There is a number of results of this type, see, e.g., Győri [5]. Also the sizes grow exponentially, one can easily generalize it for other sequences.…”
Section: Union-free Subfamiliesmentioning
confidence: 88%
“…Theorem (Győri, [7]). There exists such a constant c > 0 that the following inequality holds: F 6 (n) ≤ π(n) + π(n/2) + cn 2/3 log n.…”
Section: Corollariesmentioning
confidence: 99%
“…Erdős, Sárközy and T. Sós proved the following estimates for k = 3: π(n) + π (n/2) + c n 2/3 (log n) 4/3 ≤ F 6 (n) ≤ π(n) + π (n/2) + cn 7/9 log n. Besides, they noted that by improving their graph theoretic lemma used in the proof the upper bound π(n) + π(n/2) + cn 2/3 log n could be obtained, so the lower and upper bounds would only differ in a logpower factor in the error term. Later Győri [7] improved this graph theoretic lemma, and gained the desired bound. Furthermore, Erdős, Sárközy and T. Sós gave the following estimates for k = 4:…”
Section: Introductionmentioning
confidence: 99%