Log in

Relevant bibliographies by topics / Problème de Turán / Journal articles

Journal articles on the topic 'Problème de Turán'

To see the other types of publications on this topic, follow the link: Problème de Turán.

Author: Grafiati

Published: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Problème de Turán.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

KEEVASH, PETER, DHRUV MUBAYI, BENNY SUDAKOV, and JACQUES VERSTRAËTE. "Rainbow Turán Problems." Combinatorics, Probability and Computing 16, no. 01 (September 4, 2006): 109. http://dx.doi.org/10.1017/s0963548306007760.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bollobás, Béla. "Turán-Ramsey problems." Discrete Mathematics 156, no. 1-3 (September 1996): 257–62. http://dx.doi.org/10.1016/0012-365x(96)00024-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Keevash, Peter, Mike Saks, Benny Sudakov, and Jacques Verstraëte. "Multicolour Turán problems." Advances in Applied Mathematics 33, no. 2 (August 2004): 238–62. http://dx.doi.org/10.1016/j.aam.2003.08.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Frankl, Peter, Hao Huang, and Vojtěch Rödl. "On local Turán problems." Journal of Combinatorial Theory, Series A 177 (January 2021): 105329. http://dx.doi.org/10.1016/j.jcta.2020.105329.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

BOLLOBÁS, BÉLA, IMRE LEADER, and CLAUDIA MALVENUTO. "Daisies and Other Turán Problems." Combinatorics, Probability and Computing 20, no. 5 (August 18, 2011): 743–47. http://dx.doi.org/10.1017/s0963548311000319.

Full text

Abstract:

Our aim in this note is to make some conjectures about extremal densities of daisy-free families, where a ‘daisy’ is a certain hypergraph. These questions turn out to be related to some Turán problems in the hypercube, but they are also natural in their own right. We start by giving the daisy conjectures, and some related problems, and shall then go on to describe the connection with vertex-Turán problems in the hypercube.

APA, Harvard, Vancouver, ISO, and other styles

6

Mubayi*, Dhruv, and Vojtěch Rödl†. "Supersaturation For Ramsey-Turán Problems." Combinatorica 26, no. 3 (June 2006): 315–32. http://dx.doi.org/10.1007/s00493-006-0018-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Mubayi, Dhruv, and Yi Zhao. "Non-uniform Turán-type problems." Journal of Combinatorial Theory, Series A 111, no. 1 (July 2005): 106–10. http://dx.doi.org/10.1016/j.jcta.2004.11.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bennett, Patrick, Sean English, and Maria Talanda-Fisher. "Weighted Turán problems with applications." Discrete Mathematics 342, no. 8 (August 2019): 2165–72. http://dx.doi.org/10.1016/j.disc.2019.04.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Frankl, Peter, and Jiaxi Nie. "On asymptotic local Turán problems." Moscow Journal of Combinatorics and Number Theory 12, no. 4 (December 8, 2023): 273–86. http://dx.doi.org/10.2140/moscow.2023.12.273.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Mani, Nitya, and Edward Yu. "Turán problems for mixed graphs." Journal of Combinatorial Theory, Series B 167 (July 2024): 119–63. http://dx.doi.org/10.1016/j.jctb.2024.02.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Spiro, Sam, and Jacques Verstraëte. "Relative Turán Problems for Uniform Hypergraphs." SIAM Journal on Discrete Mathematics 35, no. 3 (January 2021): 2170–91. http://dx.doi.org/10.1137/20m1364631.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Xu, Zixiang, Yifan Jing, and Gennian Ge. "On vertex-induced weighted Turán problems." Discrete Mathematics 345, no. 1 (January 2022): 112628. http://dx.doi.org/10.1016/j.disc.2021.112628.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Peng, Xing, and Craig Timmons. "Infinite Turán Problems for Bipartite Graphs." SIAM Journal on Discrete Mathematics 28, no. 2 (January 2014): 702–10. http://dx.doi.org/10.1137/130922987.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Johnson, J. Robert, and John Talbot. "Vertex Turán problems in the hypercube." Journal of Combinatorial Theory, Series A 117, no. 4 (May 2010): 454–65. http://dx.doi.org/10.1016/j.jcta.2009.07.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Kostochka, Alexandr, Dhruv Mubayi, and Jacques Verstraëte. "Turán problems and shadows II: Trees." Journal of Combinatorial Theory, Series B 122 (January 2017): 457–78. http://dx.doi.org/10.1016/j.jctb.2016.06.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Gerbner, Dániel, Ervin Győri, Abhishek Methuku, and Máté Vizer. "Generalized Turán problems for even cycles." Journal of Combinatorial Theory, Series B 145 (November 2020): 169–213. http://dx.doi.org/10.1016/j.jctb.2020.05.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Füredi, Zoltán, and André Kündgen. "Turán problems for integer-weighted graphs." Journal of Graph Theory 40, no. 4 (June 25, 2002): 195–225. http://dx.doi.org/10.1002/jgt.10012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Gerbner, Dániel, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Gábor Tardos, and Máté Vizer. "Turán problems for edge-ordered graphs." Journal of Combinatorial Theory, Series B 160 (May 2023): 66–113. http://dx.doi.org/10.1016/j.jctb.2022.12.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Gerbner, Dániel. "Generalized Turán problems for double stars." Discrete Mathematics 346, no. 7 (July 2023): 113395. http://dx.doi.org/10.1016/j.disc.2023.113395.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Gerbner, Dániel, and Cory Palmer. "Some exact results for generalized Turán problems." European Journal of Combinatorics 103 (June 2022): 103519. http://dx.doi.org/10.1016/j.ejc.2022.103519.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Gerbner, Dániel, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, and Máté Vizer. "Vertex Turán problems for the oriented hypercube." Acta Universitatis Sapientiae, Mathematica 13, no. 2 (December 1, 2021): 356–66. http://dx.doi.org/10.2478/ausm-2021-0022.

Full text

Abstract:

Abstract In this short note we consider the oriented vertex Turán problem in the hypercube: for a fixed oriented graph F → \vec F , determine the maximum cardinality e x v ( F → , Q → n ) e{x_v}\left( {\vec F,{{\vec Q}_n}} \right) of a subset U of the vertices of the oriented hypercube Q → n {\vec Q_n} such that the induced subgraph Q → n [ U ] {\vec Q_n}\left[ U \right] does not contain any copy of F → \vec F . We obtain the exact value of e x v ( P k , → Q n → ) e{x_v}\left( {\overrightarrow {{P_k},} \,\overrightarrow {{Q_n}} } \right) for the directed path P k → \overrightarrow {{P_k}} , the exact value of e x v ( V 2 → , Q n → ) e{x_v}\left( {\overrightarrow {{V_2}} ,\,\overrightarrow {{Q_n}} } \right) for the directed cherry V 2 → \overrightarrow {{V_2}} and the asymptotic value of e x v ( T → , Q n → ) e{x_v}\left( {\overrightarrow T ,\overrightarrow {{Q_n}} } \right) for any directed tree T → \vec T .

APA, Harvard, Vancouver, ISO, and other styles

22

Balogh, József, Hong Liu, and Maryam Sharifzadeh. "On Two Problems in Ramsey--Turán Theory." SIAM Journal on Discrete Mathematics 31, no. 3 (January 2017): 1848–66. http://dx.doi.org/10.1137/16m1086078.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Vértesi, P. "Turán type problems on mean convergence. II." Acta Mathematica Hungarica 65, no. 3 (September 1994): 237–42. http://dx.doi.org/10.1007/bf01875151.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Bialostocki, A., and N. Sauer. "On Ramsey-Turán type problems in tournaments." Discrete Mathematics 59, no. 3 (May 1986): 221–28. http://dx.doi.org/10.1016/0012-365x(86)90168-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Frankl, P., and Z. Füredi. "Exact solution of some Turán-type problems." Journal of Combinatorial Theory, Series A 45, no. 2 (July 1987): 226–62. http://dx.doi.org/10.1016/0097-3165(87)90016-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

MOSSINGHOFF, MICHAEL J., and TIMOTHY S. TRUDGIAN. "BETWEEN THE PROBLEMS OF PÓLYA AND TURÁN." Journal of the Australian Mathematical Society 93, no. 1-2 (September 27, 2012): 157–71. http://dx.doi.org/10.1017/s1446788712000201.

Full text

Abstract:

AbstractWe investigate the behaviour of the function $L_{\alpha }(x) = \sum _{n\leq x}\lambda (n)/n^{\alpha }$, where $\lambda (n)$ is the Liouville function and $\alpha $ is a real parameter. The case where $\alpha =0$ was investigated by Pólya; the case $\alpha =1$, by Turán. The question of the existence of sign changes in both of these cases is related to the Riemann hypothesis. Using both analytic and computational methods, we investigate similar problems for the more general family $L_{\alpha }(x)$, where $0\leq \alpha \leq 1$, and their relationship to the Riemann hypothesis and other properties of the zeros of the Riemann zeta function. The case where $\alpha =1/2$is of particular interest.

APA, Harvard, Vancouver, ISO, and other styles

27

Li, H., V. Nikiforov, and R. H. Schelp. "A new class of Ramsey–Turán problems." Discrete Mathematics 310, no. 24 (December 2010): 3579–83. http://dx.doi.org/10.1016/j.disc.2010.09.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Gerbner, Dániel, Abhishek Methuku, and Cory Palmer. "General lemmas for Berge–Turán hypergraph problems." European Journal of Combinatorics 86 (May 2020): 103082. http://dx.doi.org/10.1016/j.ejc.2020.103082.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Balogh, József, Ce Chen, Grace McCourt, and Cassie Murley. "Ramsey–Turán problems with small independence numbers." European Journal of Combinatorics 118 (May 2024): 103872. http://dx.doi.org/10.1016/j.ejc.2023.103872.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Talbot, John. "Chromatic Turán problems and a new upper bound for the Turán density of K4−." European Journal of Combinatorics 28, no. 8 (November 2007): 2125–42. http://dx.doi.org/10.1016/j.ejc.2007.04.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Ni, Zhenyu, Liying Kang, and Erfang Shan. "Turán Problems for Berge-(k, p)-Fan Hypergraph." Chinese Annals of Mathematics, Series B 42, no. 4 (July 2021): 487–94. http://dx.doi.org/10.1007/s11401-021-0272-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Kostochka, Alexandr, Dhruv Mubayi, and Jacques Verstraëte. "Turán Problems and Shadows III: Expansions of Graphs." SIAM Journal on Discrete Mathematics 29, no. 2 (January 2015): 868–76. http://dx.doi.org/10.1137/140977138.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Sudakov, Benny. "A few remarks on Ramsey–Turán-type problems." Journal of Combinatorial Theory, Series B 88, no. 1 (May 2003): 99–106. http://dx.doi.org/10.1016/s0095-8956(02)00038-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Schelp, R. H. "Some Ramsey–Turán type problems and related questions." Discrete Mathematics 312, no. 14 (July 2012): 2158–61. http://dx.doi.org/10.1016/j.disc.2011.09.015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Gerbner, Dániel, Abhishek Methuku, and Máté Vizer. "Generalized Turán problems for disjoint copies of graphs." Discrete Mathematics 342, no. 11 (November 2019): 3130–41. http://dx.doi.org/10.1016/j.disc.2019.06.022.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Shangguan, Chong, and Itzhak Tamo. "New Turán Exponents for Two Extremal Hypergraph Problems." SIAM Journal on Discrete Mathematics 34, no. 4 (January 2020): 2338–45. http://dx.doi.org/10.1137/20m1325769.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Kostochka, Alexandr, Dhruv Mubayi, and Jacques Verstraëte. "Turán problems and shadows I: Paths and cycles." Journal of Combinatorial Theory, Series A 129 (January 2015): 57–79. http://dx.doi.org/10.1016/j.jcta.2014.09.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Keevash, Peter. "A hypergraph regularity method for generalized Turán problems." Random Structures and Algorithms 34, no. 1 (January 2009): 123–64. http://dx.doi.org/10.1002/rsa.20249.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Sidorenko, Alexander. "On Turán problems for Cartesian products of graphs." Journal of Combinatorial Designs 27, no. 7 (January 27, 2019): 411–14. http://dx.doi.org/10.1002/jcd.21651.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Gerbner, Dániel. "On the extremal graphs in generalized Turán problems." Discrete Mathematics 347, no. 6 (June 2024): 114021. http://dx.doi.org/10.1016/j.disc.2024.114021.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Andersson, J. "On some power sum problems of Turán and Erdős." Acta Mathematica Hungarica 70, no. 4 (December 1996): 305–16. http://dx.doi.org/10.1007/bf02187393.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Palmer, Cory, Michael Tait, Craig Timmons, and Adam Zsolt Wagner. "Turán numbers for Berge-hypergraphs and related extremal problems." Discrete Mathematics 342, no. 6 (June 2019): 1553–63. http://dx.doi.org/10.1016/j.disc.2019.02.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Gyárfás, András. "Ramsey and Turán-type problems in bipartite geometric graphs." Electronic Notes in Discrete Mathematics 31 (August 2008): 253–54. http://dx.doi.org/10.1016/j.endm.2008.06.051.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Mubayi, Dhruv, and Vera T. Sós. "Explicit constructions of triple systems for Ramsey–Turán problems." Journal of Graph Theory 52, no. 3 (2006): 211–16. http://dx.doi.org/10.1002/jgt.20156.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Gerbner, Dániel. "Some Stability and Exact Results in Generalized Turán Problems." Studia Scientiarum Mathematicarum Hungarica 60, no. 1 (April 26, 2023): 16–26. http://dx.doi.org/10.1556/012.2023.01533.

Full text

Abstract:

Given graphs H and F, the generalized Turán number ex(n, H, F) is the largest number of copies of H in n-vertex F-free graphs. Stability refers to the usual phenomenon that if an n-vertex F-free graph G contains almost ex(n, H, F) copies of H, then G is in some sense similar to some extremal graph. We obtain new stability results for generalized Turán problems and derive several new exact results.

APA, Harvard, Vancouver, ISO, and other styles

46

Stimilli, Flavio, Mladen Obad Šćitaroci, and Massimo Sargolini. "Turin, Sochi and Krakow in the Context of Winter Olympics." Prostor 24, no. 1(51) (June 30, 2016): 74–89. http://dx.doi.org/10.31522/p.24.1(51).6.

Full text

Abstract:

U modernim Zimskim olimpijskim igrama utjecaj sportskih građevina i infrastrukture na teritorij i krajolik, posebice prometne mreže potrebne za povezivanje grada domaćina sa sportskim terenima u planinama, jedan je od glavnih izazovnih problema - pitanje od posebne važnosti za planere. S planerskoga motrišta analizirana su tri sluèaja koja ukazuju na zajedničke i različite probleme, strategije i posljedice: Torino 2006., Soči 2014. i plan za Krakov 2022.

APA, Harvard, Vancouver, ISO, and other styles

47

Fitch, Matthew. "Rational exponents for hypergraph Turan problems." Journal of Combinatorics 10, no. 1 (2019): 61–86. http://dx.doi.org/10.4310/joc.2019.v10.n1.a3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Cera, M., A. Dianez, P. Garcia-Vazquez, and J. C. Valenzuela. "Minor extremal problems using Turan graphs." International Mathematical Forum 2 (2007): 3105–13. http://dx.doi.org/10.12988/imf.2007.07286.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Vértesi, P. "Turán type problems on mean convergence. I (lagrange type interpolations)." Acta Mathematica Hungarica 65, no. 2 (June 1994): 115–39. http://dx.doi.org/10.1007/bf01874308.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Liu, Erica L. L., and Jian Wang. "Turán problems for vertex-disjoint cliques in multi-partite hypergraphs." Discrete Mathematics 343, no. 10 (October 2020): 112005. http://dx.doi.org/10.1016/j.disc.2020.112005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!