Gotowe bibliografie tematyczne / Random graphs

Spis treści

  1. Artykuły w czasopismach
  2. Rozprawy doktorskie
  3. Książki
  4. Części książek
  5. Streszczenia konferencji
  6. Raporty organizacyjne

Gotowa bibliografia na temat „Random graphs”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 25 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Random graphs”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Random graphs"

1

FÜRER, MARTIN, and SHIVA PRASAD KASIVISWANATHAN. "Approximately Counting Embeddings into Random Graphs." Combinatorics, Probability and Computing 23, no. 6 (2014): 1028–56. http://dx.doi.org/10.1017/s0963548314000339.

Pełny tekst źródła
Streszczenie:
LetHbe a graph, and letCH(G) be the number of (subgraph isomorphic) copies ofHcontained in a graphG. We investigate the fundamental problem of estimatingCH(G). Previous results cover only a few specific instances of this general problem, for example the case whenHhas degree at most one (the monomer-dimer problem). In this paper we present the first general subcase of the subgraph isomorphism counting problem, which is almost always efficiently approximable. The results rely on a new graph decomposition technique. Informally, the decomposition is a labelling of the vertices such that every edge
Style APA, Harvard, Vancouver, ISO itp.
2

McDiarmid, C. "RANDOM GRAPHS." Bulletin of the London Mathematical Society 19, no. 3 (1987): 273. http://dx.doi.org/10.1112/blms/19.3.273a.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Ruciński, A. "Random graphs." ZOR Zeitschrift für Operations Research Methods and Models of Operations Research 33, no. 2 (1989): 145. http://dx.doi.org/10.1007/bf01415170.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Borbély, József, and András Sárközy. "Quasi-Random Graphs, Pseudo-Random Graphs and Pseudorandom Binary Sequences, I. (Quasi-Random Graphs)." Uniform distribution theory 14, no. 2 (2019): 103–26. http://dx.doi.org/10.2478/udt-2019-0017.

Pełny tekst źródła
Streszczenie:
AbstractIn the last decades many results have been proved on pseudo-randomness of binary sequences. In this series our goal is to show that using many of these results one can also construct large families of quasi-random, pseudo-random and strongly pseudo-random graphs. Indeed, it will be proved that if the first row of the adjacency matrix of a circulant graph forms a binary sequence which possesses certain pseudorandom properties (and there are many large families of binary sequences known with these properties), then the graph is quasi-random, pseudo-random or strongly pseudo-random, respe
Style APA, Harvard, Vancouver, ISO itp.
5

Gao, Yong. "Treewidth of Erdős–Rényi random graphs, random intersection graphs, and scale-free random graphs." Discrete Applied Mathematics 160, no. 4-5 (2012): 566–78. http://dx.doi.org/10.1016/j.dam.2011.10.013.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

KOHAYAKAWA, YOSHIHARU, GUILHERME OLIVEIRA MOTA, and MATHIAS SCHACHT. "Monochromatic trees in random graphs." Mathematical Proceedings of the Cambridge Philosophical Society 166, no. 1 (2018): 191–208. http://dx.doi.org/10.1017/s0305004117000846.

Pełny tekst źródła
Streszczenie:
AbstractBal and DeBiasio [Partitioning random graphs into monochromatic components, Electron. J. Combin.24(2017), Paper 1.18] put forward a conjecture concerning the threshold for the following Ramsey-type property for graphsG: everyk-colouring of the edge set ofGyieldskpairwise vertex disjoint monochromatic trees that partition the whole vertex set ofG. We determine the threshold for this property for two colours.
Style APA, Harvard, Vancouver, ISO itp.
7

Whittle, P. "Random fields on random graphs." Advances in Applied Probability 24, no. 2 (1992): 455–73. http://dx.doi.org/10.2307/1427700.

Pełny tekst źródła
Streszczenie:
The distribution (1) used previously by the author to represent polymerisation of several types of unit also prescribes quite general statistics for a random field on a random graph. One has the integral expression (3) for its partition function, but the multiple complex form of the integral makes the nature of the expected saddlepoint evaluation in the thermodynamic limit unclear. It is shown in Section 4 that such an evaluation at a real positive saddlepoint holds, and subsidiary conditions narrowing down the choice of saddlepoint are deduced in Section 6. The analysis simplifies greatly in
Style APA, Harvard, Vancouver, ISO itp.
8

Bender, E. A., and N. C. Wormald. "Random trees in random graphs." Proceedings of the American Mathematical Society 103, no. 1 (1988): 314. http://dx.doi.org/10.1090/s0002-9939-1988-0938689-5.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Whittle, P. "Random fields on random graphs." Advances in Applied Probability 24, no. 02 (1992): 455–73. http://dx.doi.org/10.1017/s0001867800047601.

Pełny tekst źródła
Streszczenie:
The distribution (1) used previously by the author to represent polymerisation of several types of unit also prescribes quite general statistics for a random field on a random graph. One has the integral expression (3) for its partition function, but the multiple complex form of the integral makes the nature of the expected saddlepoint evaluation in the thermodynamic limit unclear. It is shown in Section 4 that such an evaluation at a real positive saddlepoint holds, and subsidiary conditions narrowing down the choice of saddlepoint are deduced in Section 6. The analysis simplifies greatly in
Style APA, Harvard, Vancouver, ISO itp.
10

?uczak, Tomasz. "Random trees and random graphs." Random Structures and Algorithms 13, no. 3-4 (1998): 485–500. http://dx.doi.org/10.1002/(sici)1098-2418(199810/12)13:3/4<485::aid-rsa16>3.0.co;2-y.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Random graphs"

1

Ramos, Garrido Lander. "Graph enumeration and random graphs." Doctoral thesis, Universitat Politècnica de Catalunya, 2017. http://hdl.handle.net/10803/405943.

Pełny tekst źródła
Streszczenie:
In this thesis we use analytic combinatorics to deal with two related problems: graph enumeration and random graphs from constrained classes of graphs. We are interested in drawing a general picture of some graph families by determining, first, how many elements are there of a given possible size (graph enumeration), and secondly, what is the typical behaviour of an element of fixed size chosen uniformly at random, when the size tends to infinity (random graphs). The problems concern graphs subject to global conditions, such as being planar and/or with restrictions on the degrees of the verti
Style APA, Harvard, Vancouver, ISO itp.
2

Seierstad, Taral Guldahl. "The phase transition in random graphs and random graph processes." Doctoral thesis, [S.l.] : [s.n.], 2007. http://deposit.ddb.de/cgi-bin/dokserv?idn=985760044.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Engström, Stefan. "Random acyclicorientations of graphs." Thesis, KTH, Matematik (Avd.), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-116500.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Heckel, Annika. "Colourings of random graphs." Thesis, University of Oxford, 2016. https://ora.ox.ac.uk/objects/uuid:79e14d55-0589-4e17-bbb5-a216d81b8875.

Pełny tekst źródła
Streszczenie:
We study graph parameters arising from different types of colourings of random graphs, defined broadly as an assignment of colours to either the vertices or the edges of a graph. The chromatic number X(G) of a graph is the minimum number of colours required for a vertex colouring where no two adjacent vertices are coloured the same. Determining the chromatic number is one of the classic challenges in random graph theory. In Chapter 3, we give new upper and lower bounds for the chromatic number of the dense random graph G(n,p)) where p &isin; (0,1) is constant. These bounds are the first to mat
Style APA, Harvard, Vancouver, ISO itp.
5

Oosthuizen, Joubert. "Random walks on graphs." Thesis, Stellenbosch : Stellenbosch University, 2014. http://hdl.handle.net/10019.1/86244.

Pełny tekst źródła
Streszczenie:
Thesis (MSc)--Stellenbosch University, 2014.<br>ENGLISH ABSTRACT: We study random walks on nite graphs. The reader is introduced to general Markov chains before we move on more specifically to random walks on graphs. A random walk on a graph is just a Markov chain that is time-reversible. The main parameters we study are the hitting time, commute time and cover time. We nd novel formulas for the cover time of the subdivided star graph and broom graph before looking at the trees with extremal cover times. Lastly we look at a connection between random walks on graphs and electrical netw
Style APA, Harvard, Vancouver, ISO itp.
6

Bienvenu, François. "Random graphs in evolution." Thesis, Sorbonne université, 2019. http://www.theses.fr/2019SORUS180.

Pełny tekst źródła
Streszczenie:
Cette thèse est composée de cinq projets de recherche indépendants, tous en lien soit avec les graphes aléatoires, soit avec la biologie évolutive - mais pour la plupart à l'interface de ces deux disciplines. Dans les Chapitres 2 et 3, nous introduisons deux modèles de graphes aléatoires correspondant à la distribution stationnaire d'une chaîne de Markov. Le premier de ces modèles, que nous appelons le graphe "split-and-drift", décrit la structure et la dynamique des réseaux d'interfécondité; le second est une forêt aléatoire inspirée du modèle de Moran, modèle central de la génétique des popu
Style APA, Harvard, Vancouver, ISO itp.
7

Johansson, Tony. "Random Graphs and Algorithms." Research Showcase @ CMU, 2017. http://repository.cmu.edu/dissertations/938.

Pełny tekst źródła
Streszczenie:
This thesis is concerned with the study of random graphs and random algorithms. There are three overarching themes. One theme is sparse random graphs, i.e. random graphs in which the average degree is bounded with high probability. A second theme is that of finding spanning subsets such as spanning trees, perfect matchings and Hamilton cycles. A third theme is solving optimization problems on graphs with random edge costs.
Style APA, Harvard, Vancouver, ISO itp.
8

Ross, Christopher Jon. "Properties of Random Threshold and Bipartite Graphs." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1306296991.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Pymar, Richard James. "Random graphs and random transpositions on a circle." Thesis, University of Cambridge, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.610350.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Crippa, Davide. "q-distributions and random graphs /." [S.l.] : [s.n.], 1994. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=10923.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Książki na temat "Random graphs"

1

Janson, Svante, Tomasz Łuczak, and Andrzej Rucinski. Random Graphs. John Wiley & Sons, Inc., 2000. http://dx.doi.org/10.1002/9781118032718.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Kolchin, V. F. Random graphs. Cambridge University Press, 1999.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

International Seminar on Random Graphs and Probabilistic Methods in Combinatorics. (2nd 1985 Uniwersytet im. Adama Mickiewicza w Poznaniu. Instytut Matematyki). Random graphs '85. North-Holland, 1987.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Chatterjee, Sourav. Large Deviations for Random Graphs. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-65816-2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Ceccherini-Silberstein, Tullio, Maura Salvatori, and Ecaterina Sava-Huss, eds. Groups, Graphs and Random Walks. Cambridge University Press, 2017. http://dx.doi.org/10.1017/9781316576571.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Palka, Zbigniew. Asymptotic properties of random graphs. Państwowe Wydawn. Nauk., 1988.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Grimmett, Geoffrey. Probability on graphs: Random processes on graphs and lattices. Cambridge University Press, 2010.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Marchette, David J. Random Graphs for Statistical Pattern Recognition. John Wiley & Sons, Inc., 2004. http://dx.doi.org/10.1002/047172209x.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Spencer, Joel. The Strange Logic of Random Graphs. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-662-04538-1.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Spencer, Joel H. The strange logic of random graphs. Springer, 2001.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Części książek na temat "Random graphs"

1

Bollobás, Béla. "Random Graphs." In Modern Graph Theory. Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4612-0619-4_7.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Brémaud, Pierre. "Random Graphs." In Discrete Probability Models and Methods. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-43476-6_10.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Diestel, Reinhard. "Random Graphs." In Graph Theory. Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-662-53622-3_11.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Li, Xueliang, Colton Magnant, and Zhongmei Qin. "Random Graphs." In Properly Colored Connectivity of Graphs. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89617-5_7.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Bonato, Anthony, and Richard Nowakowski. "Random graphs." In The Student Mathematical Library. American Mathematical Society, 2011. http://dx.doi.org/10.1090/stml/061/06.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Bonato, Anthony. "Random graphs." In Graduate Studies in Mathematics. American Mathematical Society, 2008. http://dx.doi.org/10.1090/gsm/089/03.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Diestel, Reinhard. "Random Graphs." In Graph Theory. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-642-14279-6_11.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Diestel, Reinhard. "Random Graphs." In Graduate Texts in Mathematics. Springer Berlin Heidelberg, 2024. https://doi.org/10.1007/978-3-662-70107-2_11.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Prömel, Hans Jürgen, and Anusch Taraz. "Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders." In Computational Discrete Mathematics. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45506-x_8.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Gao, Pu, Mikhail Isaev, and Brendan D. McKay. "Sandwiching random regular graphs between binomial random graphs." In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2020. http://dx.doi.org/10.1137/1.9781611975994.42.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Random graphs"

1

Oren-Loberman, Mor, Vered Paslev, and Wasim Huleihel. "Testing Dependency of Weighted Random Graphs." In 2024 IEEE International Symposium on Information Theory (ISIT). IEEE, 2024. http://dx.doi.org/10.1109/isit57864.2024.10619266.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Frieze, Alan. "Random graphs." In the seventeenth annual ACM-SIAM symposium. ACM Press, 2006. http://dx.doi.org/10.1145/1109557.1109663.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Feng, Lijin, and Jackson Barr. "Complete Graphs and Bipartite Graphs in a Random Graph." In 2021 5th International Conference on Vision, Image and Signal Processing (ICVISP). IEEE, 2021. http://dx.doi.org/10.1109/icvisp54630.2021.00054.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Mota, Guilherme Oliveira. "Advances in anti-Ramsey theory for random graphs." In II Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2017. http://dx.doi.org/10.5753/etc.2017.3204.

Pełny tekst źródła
Streszczenie:
Dados grafos G e H, denotamos a seguinte propriedade por G ÝrÑpb H: para toda coloração própria das arestas de G (com uma quantidade arbitrária de cores) existe uma cópia multicolorida de H em G, i.e., uma cópia de H sem duas arestas da mesma cor. Sabe-se que, para todo grafo H, a função limiar prHb prHbpnq para essa propriedade no grafo aleatório binomial Gpn; pq é assintoticamente no máximo n 1{mp2qpHq, onde mp2qpHq denota a assim chamada 2-densidade máxima de H. Neste trabalho discutimos esse e alguns resultados recentes no estudo de propriedades anti-Ramsey para grafos aleatórios, e mostra
Style APA, Harvard, Vancouver, ISO itp.
5

Söderberg, B. "Random Feynman Graphs." In SCIENCE OF COMPLEX NETWORKS: From Biology to the Internet and WWW: CNET 2004. AIP, 2005. http://dx.doi.org/10.1063/1.1985383.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Frieze, Alan, Santosh Vempala, and Juan Vera. "Logconcave random graphs." In the 40th annual ACM symposium. ACM Press, 2008. http://dx.doi.org/10.1145/1374376.1374487.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Zhao, Xiangyu, Hanzhou Wu, and Xinpeng Zhang. "Watermarking Graph Neural Networks by Random Graphs." In 2021 9th International Symposium on Digital Forensics and Security (ISDFS). IEEE, 2021. http://dx.doi.org/10.1109/isdfs52919.2021.9486352.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Aiello, William, Fan Chung, and Linyuan Lu. "A random graph model for massive graphs." In the thirty-second annual ACM symposium. ACM Press, 2000. http://dx.doi.org/10.1145/335305.335326.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Servetto, Sergio D., and Guillermo Barrenechea. "Constrained random walks on random graphs." In the 1st ACM international workshop. ACM Press, 2002. http://dx.doi.org/10.1145/570738.570741.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Kim, Jeong Han, and Van H. Vu. "Generating random regular graphs." In the thirty-fifth ACM symposium. ACM Press, 2003. http://dx.doi.org/10.1145/780542.780576.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Random graphs"

1

Mesbahi, Mehran. Dynamic Security and Robustness of Networked Systems: Random Graphs, Algebraic Graph Theory, and Control over Networks. Defense Technical Information Center, 2012. http://dx.doi.org/10.21236/ada567125.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Pawagi, Shaunak, and I. V. Ramakrishnan. Updating Properties of Directed Acyclic Graphs on a Parallel Random Access Machine. Defense Technical Information Center, 1985. http://dx.doi.org/10.21236/ada162954.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Moseman, Elizabeth. Improving the Computational Efficiency of the Blitzstein-Diaconis Algorithm for Generating Random Graphs of Prescribed Degree. National Institute of Standards and Technology, 2015. http://dx.doi.org/10.6028/nist.ir.8066.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Han, Guang, and Armand M. Makowski. A Strong Zero-One Law for Connectivity in One-Dimensional Geometric Random Graphs With Non-Vanishing Densities. Defense Technical Information Center, 2007. http://dx.doi.org/10.21236/ada468079.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Chandrasekhar, Arun, and Matthew Jackson. Tractable and Consistent Random Graph Models. National Bureau of Economic Research, 2014. http://dx.doi.org/10.3386/w20276.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Carley, Kathleen M., and Eunice J. Kim. Random Graph Standard Network Metrics Distributions in ORA. Defense Technical Information Center, 2008. http://dx.doi.org/10.21236/ada487516.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Shue, Kelly, and Richard Townsend. How do Quasi-Random Option Grants Affect CEO Risk-Taking? National Bureau of Economic Research, 2017. http://dx.doi.org/10.3386/w23091.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

McCulloh, Ian, Joshua Lospinoso, and Kathleen M. Carley. The Link Probability Model: A Network Simulation Alternative to the Exponential Random Graph Model. Defense Technical Information Center, 2010. http://dx.doi.org/10.21236/ada537329.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Yoshida, Masami, Nammon Ruangrit, and Vorasuang Duangchinda. The application of exponential random graph models to online learning networks: a scoping review protocol. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, 2024. http://dx.doi.org/10.37766/inplasy2024.7.0039.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Doerschuk, Peter C. University LDRD student progress report on descriptions and comparisons of brain microvasculature via random graph models. Office of Scientific and Technical Information (OSTI), 2012. http://dx.doi.org/10.2172/1055646.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Random graphs” dla poszczególnych typów źródeł:
Artykuły w czasopismach Rozprawy doktorskie Książki
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii