Academic literature on the topic 'Ramsey minimal'

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Ramsey minimal.'

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.

Journal articles on the topic "Ramsey minimal"

1

Bollobás, Béla, Jair Donadelli, Yoshiharu Kohayakawa, and Richard H. Schelp. "Ramsey minimal graphs." Journal of the Brazilian Computer Society 7, no. 3 (2001): 27–37. http://dx.doi.org/10.1590/s0104-65002001000200005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Rödl, V., and M. Siggers. "On Ramsey Minimal Graphs." SIAM Journal on Discrete Mathematics 22, no. 2 (2008): 467–88. http://dx.doi.org/10.1137/050647116.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Rollin, Jonathan. "Minimal ordered Ramsey graphs." Discrete Mathematics 343, no. 10 (2020): 112023. http://dx.doi.org/10.1016/j.disc.2020.112023.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Borowiecki, Mieczysław, Mariusz Hałuszczak, and Elżbieta Sidorowicz. "On Ramsey minimal graphs." Discrete Mathematics 286, no. 1-2 (2004): 37–43. http://dx.doi.org/10.1016/j.disc.2003.11.043.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Rais, Hidayati, Lyra Yulianti, and Admi Nazra. "Graf Ramsey (3K2, C3)-Minimal." Jurnal Matematika UNAND 4, no. 2 (2019): 11. http://dx.doi.org/10.25077/jmu.4.2.11-15.2015.

Full text
Abstract:
Misalkan diberikan graf G dan H sebarang. Notasi F → (G, H) berarti bahwa pada sebarang pewarnaan 2-warna, merah atau biru, terhadap semua sisi graf F mengakibatkan F memuat subgraf merah yang isomorfik dengan G atau subgraf biru yang isomorfik dengan H. Graf F adalah graf Ramsey (G, H)-minimal jika F → (G, H) dan F ∗ 9 (G, H) untuk sebarang subgraf sejati F ∗ ⊂ F. Selanjutnya R(G, H) menyatakan kelas yang memuat semua graf Ramsey (G, H)-minimal. Pada tulisan ini diberikan beberapa syarat perlu untuk keanggotaan R(3K2, C3) serta beberapa graf yang menjadi anggota R(3K2, C3).Kata Kunci: Graf Ra
APA, Harvard, Vancouver, ISO, and other styles
6

Nadia, Nadia, Lyra Yulianti, and Narwen Narwen. "GRAF RAMSEY (3K2, 2P4) - MINIMAL." Jurnal Matematika UNAND 8, no. 1 (2019): 219. http://dx.doi.org/10.25077/jmu.8.1.219-223.2019.

Full text
Abstract:
Diberikan graf G dan H. Notasi F → (G, H) berarti bahwa pada sebarang pewarnaan merah-biru terhadap sisi-sisi graf F, terdapat subgraf G yang memuat semua sisinya merah, atau subgraf H yang memuat semua sisinya biru. Kemudian notasi F ∗ 9 (G, H) berarti bahwa terdapat pewarnaan merah-biru terhadap sisi-sisi graf F ∗, sedemikian sehingga tidak terdapat subgraf G yang semua sisinya merah dan subgraf H yang semua sisinya biru. Graf F dikatakan sebagai graf Ramsey (G, H) − minimal jika, (1) F → (G, H), (2) F ∗ 9 (G, H) dimana F ∗ := F − {e}, untuk setiap e ∈ E(F). Pewarnaan merah-biru yang tidak m
APA, Harvard, Vancouver, ISO, and other styles
7

CLEMENS, DENNIS, and YURY PERSON. "Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs." Combinatorics, Probability and Computing 25, no. 6 (2016): 850–69. http://dx.doi.org/10.1017/s0963548315000395.

Full text
Abstract:
A uniform hypergraph H is called k-Ramsey for a hypergraph F if, no matter how one colours the edges of H with k colours, there is always a monochromatic copy of F. We say that H is k-Ramsey-minimal for F if H is k-Ramsey for F but every proper subhypergraph of H is not. Burr, Erdős and Lovasz studied various parameters of Ramsey-minimal graphs. In this paper we initiate the study of minimum degrees and codegrees of Ramsey-minimal 3-uniform hypergraphs. We show that the smallest minimum vertex degree over all k-Ramsey-minimal 3-uniform hypergraphs for Kt(3) is exponential in some polynomial in
APA, Harvard, Vancouver, ISO, and other styles
8

Kechris, A. S., V. Pestov, and S. Todorcevic. "Universal minimal flows of automorphism groups." Bulletin: Classe des sciences mathematiques et natturalles 127, no. 28 (2003): 93–106. http://dx.doi.org/10.2298/bmat0328093k.

Full text
Abstract:
We investigate some connections between the Fraiss? theory of amalgamation classes and ultrahomogeneous structures, Ramsey theory, and topological dynamics of automorphism groups of countable structures. We show, in particular, that results from the structural Ramsey theory can be quite useful in recognizing the universal minimal flows of this kind of groups. As result we compute universal minimal flows of several well known topological groups such as, for example, the automorphism group of the random graph, the automorphism group of the random triangle-free graph, the automorphism group of th
APA, Harvard, Vancouver, ISO, and other styles
9

Brian, W. R. "Ramsey Shadowing and minimal points." Proceedings of the American Mathematical Society 144, no. 6 (2015): 2697–703. http://dx.doi.org/10.1090/proc/12884.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Muhshi, Hadi, and Edy Tri Baskoro. "Matching-Star Ramsey Minimal Graphs." Mathematics in Computer Science 9, no. 4 (2015): 443–52. http://dx.doi.org/10.1007/s11786-015-0244-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Ramsey minimal"

1

Liebenau, Anita [Verfasser]. "Orientation Games and Minimal Ramsey Graphs / Anita Liebenau." Berlin : Freie Universität Berlin, 2014. http://d-nb.info/1058360922/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Nguyen, Van Thé Lionel. "Théorie de Ramsey structurale et applications en dynamique topologique via la correspondance de Kechris-Pestov-Todorcevic." Habilitation à diriger des recherches, Aix-Marseille Université, 2013. http://tel.archives-ouvertes.fr/tel-00924106.

Full text
Abstract:
Le but de ce mémoire est d'effectuer un survol de mes travaux effectués depuis janvier 2007. Le sujet d'étude se situe à l'une des intersections entre la combinatoire, la dynamique topologique et la logique via le formalisme des structures ultrahomogènes et de la théorie de Fraïssé. Ce domaine a récemment connu un essor considérable grâce à deux contributions majeures par Kechris, Pestov et Todorcevic, et par Kechris et Rosendal. Mon travail part de la première de ces contributions et se concentre autour des deux thèmes suivants : Théorie de Ramsey structurale et dynamique topologique des grou
APA, Harvard, Vancouver, ISO, and other styles
3

Borgersen, Robert David. "Topics in finite graph Ramsey theory." 2008. http://hdl.handle.net/1993/2998.

Full text
Abstract:
For a positive integer $r$ and graphs $F$, $G$, and $H$, the graph Ramsey arrow notation $F \longrightarrow (G)^H_r$ means that for every $r$-colouring of the subgraphs of $F$ isomorphic to $H$, there exists a subgraph $G'$ of $F$ isomorphic to $G$ such that all the subgraphs of $G'$ isomorphic to $H$ are coloured the same. Graph Ramsey theory is the study of the graph Ramsey arrow and related arrow notations for other kinds of ``graphs" (\emph{e.g.}, ordered graphs, or hypergraphs). This thesis surveys finite graph Ramsey theory, that is, when all structures are finite. One aspect surveyed
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Ramsey minimal"

1

Baskoro, Edy Tri. "Some Open Problems of Ramsey Minimal Graphs." In Convexity and Discrete Geometry Including Graph Theory. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-28186-5_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Baskoro, Edy Tri, and Kristiana Wijaya. "On Ramsey (2K 2, K 4)−Minimal Graphs." In Springer Proceedings in Mathematics & Statistics. Springer Basel, 2014. http://dx.doi.org/10.1007/978-3-0348-0859-0_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wijaya, Kristiana, and Edy Tri Baskoro. "On Ramsey $$(2K_2, 2H)$$ ( 2 K 2 , 2 H ) -Minimal Graphs." In Applied Analysis in Biological and Physical Sciences. Springer India, 2016. http://dx.doi.org/10.1007/978-81-322-3640-5_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sousa, Teresa. "Minimum H-Decompositions of Graphs and Its Ramsey Version: A Survey." In CIM Series in Mathematical Sciences. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-16118-1_39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bergelson, Vitaly. "Minimal idempotents and ergodic Ramsey theory." In Topics in Dynamics and Ergodic Theory. Cambridge University Press, 2003. http://dx.doi.org/10.1017/cbo9780511546716.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Vaughan, Norman. "Community of Inquiry Framework, Digital Technologies, and Student Assessment in Higher Education." In Educational Communities of Inquiry. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-2110-7.ch016.

Full text
Abstract:
A number of educational researchers have stated that assessment drives learning in higher education (Biggs, 1998; Hedberg & Corrent-Agostinho, 1999; Marton & Saljo, 1984: Ramsden, 2003; Thistlethwaite, 2006). Entwistle (2000) indicates that the design of the assessment activity and the associated feedback can influence the type of learning that takes place in a course or program. For example, standardized tests with minimal feedback can lead to memorization and a surface approach to learning while collaborative group projects can encourage dialogue, richer forms of feedback, and deeper modes of learning. The purpose of this chapter is to demonstrate through a research study how the Community of Inquiry framework and digital technologies can be used to support a triad-approach to student assessment in higher education. This approach consisted of integrating self-reflection, peer feedback, and teacher assessment practices in a pre-service teacher education program at a Canadian University.
APA, Harvard, Vancouver, ISO, and other styles
7

Harbour, Daniel. "Conclusion." In Impossible Persons. The MIT Press, 2016. http://dx.doi.org/10.7551/mitpress/9780262034739.003.0010.

Full text
Abstract:
This investigation began with the very modest question of why, in languages like English, the meaning ‘we and you’ is covered by we, not you. By broadening this question to all partitions of person and related deictic spaces, we realize that there is a substantial disparity between possible and attested systems of person and person-related deixis. Such shortfall between the possible and the actual is a classic variety of linguistic problem, and, in responding to it, I have attempted to present a very minimal theory of person. The resulting system furnishes a range of desirable consequences, concerning the morphological composition of different persons, the semantic and morphological interaction of person with number, and the capacity to capture the relationship between personal and spatial deixis. What emerges is a coherent, unified view of the kernel of phi, the features that make up person and number. These results may ramify beyond phi theory into the linguistic theory of other feature families and beyond, into broader issues in cognitive science and the evolution of mind. The study of phi features brings us to a deeper understanding, not just of what we is as a pronoun, but of who we are as thinking creatures.
APA, Harvard, Vancouver, ISO, and other styles
8

Mukhopadhyay, Sumitra, and Soumyadip Das. "A System on Chip Development of Customizable GA Architecture for Real Parameter Optimization Problem." In Handbook of Research on Natural Computing for Optimization Problems. IGI Global, 2016. http://dx.doi.org/10.4018/978-1-5225-0058-2.ch004.

Full text
Abstract:
This chapter presents the design and development of a hardware based architecture of Evolutionary Algorithm for solving both the unimodal and multimodal fixed point real parameter optimization problems. Here a modular architecture has been proposed to provide a tradeoff between real time performance and flexibility and to work as a resource efficient reconfigurable device. The evolutionary algorithm used here is Genetic Algorithm. Prototype implementation of the algorithm has been performed on a system-on-chip field programmable gate array. The notable feature of the architecture is the capability of optimizing a wide class of functions with minimum or no change in the synthesized hardware. The architecture has been tested with ten benchmark problems and it has been observed that for different optimization problems the synthesized target requires maximum of 5% logic slice utilization, 2% of the available block RAMs and 2% of the DSP48 utilization in Xilinx Virtex IV (ML401, XC4VLX25) board.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Ramsey minimal"

1

Tatanto, Dedy, and Edy Tri Baskoro. "On Ramsey (2K2, 2Pn)-minimal graphs." In THE 5TH INTERNATIONAL CONFERENCE ON RESEARCH AND EDUCATION IN MATHEMATICS: ICREM5. AIP, 2012. http://dx.doi.org/10.1063/1.4724122.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Muhshi, Hadi, and Edy Tri Baskoro. "On Ramsey (3K2,P3)-minimal graphs." In THE 5TH INTERNATIONAL CONFERENCE ON RESEARCH AND EDUCATION IN MATHEMATICS: ICREM5. AIP, 2012. http://dx.doi.org/10.1063/1.4724125.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Rahmadani, Desi, Edy Tri Baskoro, and Hilda Assiyatun. "On Ramsey (P3, P6)-minimal graphs." In PROCEEDINGS OF THE 7TH SEAMS UGM INTERNATIONAL CONFERENCE ON MATHEMATICS AND ITS APPLICATIONS 2015: Enhancing the Role of Mathematics in Interdisciplinary Research. AIP Publishing LLC, 2016. http://dx.doi.org/10.1063/1.4940817.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wijaya, Kristiana, Edy Tri Baskoro, Hilda Assiyatun, and Djoko Suprijanto. "On Ramsey (3K2, K3) – minimal graphs." In PROCEEDINGS OF THE 7TH SEAMS UGM INTERNATIONAL CONFERENCE ON MATHEMATICS AND ITS APPLICATIONS 2015: Enhancing the Role of Mathematics in Interdisciplinary Research. AIP Publishing LLC, 2016. http://dx.doi.org/10.1063/1.4940826.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Nisa, Fakhrun, Desi Rahmadani, Purwanto, and Hery Susanto. "On Ramsey (P3, C6)-minimal graphs." In 28TH RUSSIAN CONFERENCE ON MATHEMATICAL MODELLING IN NATURAL SCIENCES. AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0000507.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Rahmadani, Desi, and Toto Nusantara. "On Ramsey (P4, P4) –minimal graphs for small-order." In 28TH RUSSIAN CONFERENCE ON MATHEMATICAL MODELLING IN NATURAL SCIENCES. AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0000513.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Xi, Fang, Xiaoli Qiang, and Dongming Zhao. "Efficient DNA algorithm for constructing Ramsey graph based on minimal degree vertex." In 2009 Fourth International Conference on Bio-Inspired Computing (BIC-TA). IEEE, 2009. http://dx.doi.org/10.1109/bicta.2009.5338090.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Cavalar, Bruno Pasqualotto. "Ramsey-type problems in orientations of graphs ⇤." In III Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2018.3172.

Full text
Abstract:
The Ramsey number R(H) of a graph H is the minimum number n such that there exists a graph G on n vertices with the property that every two-coloring of its edges contains a monochromatic copy of H. In this work we study a variant of this notion, called the oriented Ramsey problem, for an acyclic oriented graph H~ , in which we require that every orientation G~ of the graph G contains a copy of H~ . We also study the threshold function for this problem in random graphs. Finally, we consider the isometric case, in which we require the copy to be isometric, by which we mean that, for every two ve
APA, Harvard, Vancouver, ISO, and other styles
9

Lemoyne, Robert. "Fundamental Analysis of Potential Energy Derived Strategies for Acquiring Minimum Velocity Threshold for a Ramjet." In 17th AIAA International Space Planes and Hypersonic Systems and Technologies Conference. American Institute of Aeronautics and Astronautics, 2011. http://dx.doi.org/10.2514/6.2011-2226.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Nakata, Daisuke, Ryojiro Minato, Inaho Yoshikawa, Hiromitsu Yagihashi, Koki Arimatsu, and Masaharu Uchiumi. "The Minimum Flow Rate of Liquid-Oxygen When Considering a Throttling of a Gas Generator Cycle Engine." In ASME-JSME-KSME 2019 8th Joint Fluids Engineering Conference. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/ajkfluids2019-5621.

Full text
Abstract:
Abstract Currently in development at Muroran Institute of Technology, a small gas-generator-cycle air turbo ramjet engine (GG-ATR) for a supersonic unmanned aerial vehicle requiring deep throttling uses liquid oxygen/ethanol as a propellant. However, it is difficult to maintain a liquid-phase flow at a low mass flow rate or at a low pressure due to flashing in the feedline. In response, we investigated the ability of our ground test facility to feed liquid oxygen at a low mass flow rate. The experimental results of the flow tests validated the proposed one-dimensional model, including heat inp
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!