The document discusses Ramsey numbers and their generalization to multiple parameters. It provides examples of specific Ramsey numbers such as R(3,3,3)=17. It also discusses applications of Ramsey numbers in areas like number theory, geometry, communications, and computer science. Finally, it includes a table listing values of Ramsey numbers for various values of p and q.
On Triplet of Positive Integers Such That the Sum of Any Two of Them is a Per...inventionjournals
In this article we discussed determination of distinct positive integers a, b, c such that a + b, a + c, b + c are perfect squares. We can determine infinitely many such triplets. There are such four tuples and from them eliminating any one number we obtain triplets with the specific property. We can also obtain infinitely many such triplets from a single triplet.
This is a Question Papers of Mumbai University for B.Sc.IT Student of Semester - III [Advanced SQL] (Old Course). [Year - April / 2015] . . .Solution Set of this Paper is Coming soon..
A solution to Fermats last theorem using a colour analogyAndrew Hennessey
I know - Fermats Last Theorem - who can possibly solve something as mind bendingly difficult as this ... tens of thousands of eggheads have tried and failed ... etc etc
Don't worry I'm not looking for a Nobel Prize - but you never know - if tens of thousands of top class mathematicians couldn't get a job mixing paint in Walmart - there must be possibilities here somehow ...
Narrow sieves, representative sets and divide-and-color are three breakthrough techniques related to color coding, which led to the design of extremely fast parameterized algorithms. In this talk, I will discuss the power and limitations of these techniques. I will also briefly address some recent developments related to these techniques, including general schemes for mixing them.
RABIN KARP algorithm with hash function and hash collision, analysis, algorithm and code for implementation. Besides it contains applications of RABIN KARP algorithm also
Greedy Edge Colouring for Lower Bound of an Achromatic Index of Simple Graphsinventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
On Triplet of Positive Integers Such That the Sum of Any Two of Them is a Per...inventionjournals
In this article we discussed determination of distinct positive integers a, b, c such that a + b, a + c, b + c are perfect squares. We can determine infinitely many such triplets. There are such four tuples and from them eliminating any one number we obtain triplets with the specific property. We can also obtain infinitely many such triplets from a single triplet.
This is a Question Papers of Mumbai University for B.Sc.IT Student of Semester - III [Advanced SQL] (Old Course). [Year - April / 2015] . . .Solution Set of this Paper is Coming soon..
A solution to Fermats last theorem using a colour analogyAndrew Hennessey
I know - Fermats Last Theorem - who can possibly solve something as mind bendingly difficult as this ... tens of thousands of eggheads have tried and failed ... etc etc
Don't worry I'm not looking for a Nobel Prize - but you never know - if tens of thousands of top class mathematicians couldn't get a job mixing paint in Walmart - there must be possibilities here somehow ...
Narrow sieves, representative sets and divide-and-color are three breakthrough techniques related to color coding, which led to the design of extremely fast parameterized algorithms. In this talk, I will discuss the power and limitations of these techniques. I will also briefly address some recent developments related to these techniques, including general schemes for mixing them.
RABIN KARP algorithm with hash function and hash collision, analysis, algorithm and code for implementation. Besides it contains applications of RABIN KARP algorithm also
Greedy Edge Colouring for Lower Bound of an Achromatic Index of Simple Graphsinventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
A Quest for Subexponential Time Parameterized Algorithms for Planar-k-Path: F...cseiitgn
The field of designing subexponential time parameterized algorithms has gained a lot of momentum lately. While the subexponential time algorithm for Planar-k-Path (finding a path of length at least k on planar graphs) has been known for last 15 years. There was no such algorithms known on directed planar graphs. In this talk, I will survey this journey of designing subexponential time parameterized algorithms for finding a path of length at least k in planar undirected graphs to planar directed graphs; highlighting the new tools and techniques that got developed on the way.
Graph coloring is an important concept in graph theory. It is a special kind of problem in which we have assign colors to certain elements of the graph along with certain constraints. Suppose we are given K colors, we have to color the vertices in such a way that no two adjacent vertices of the graph have the same color, this is known as vertex coloring, similarly we have edge coloring and face coloring. The coloring problem has a huge number of applications in modern computer science such as making schedule of time table , Sudoku, Bipartite graphs , Map coloring, data mining, networking. In this paper we are going to focus on certain applications like Final exam timetabling, Aircraft Scheduling, guarding an art gallery.
A Simple Method to Build a Paper-Based Color Check Print of Colored Fabrics b...CSCJournals
An open loop color management system is implemented to reproduce an analog color of a set of colored fabrics by a digital inkjet printer. A tetrahedral interpolation technique is designed for mapping between device-dependent (RGB) and device-independent (CIELAB) color spaces. A set of 3164 color patches are used as training set in 3-D LookUp Table (LUT) to characterize the color printer. Then, the designed color management system is examined by the colorimetric reproduction of a set of 30 colored fabrics using the conventional inkjet printer. The performance of the system is numerically evaluated by measuring the color difference values between the original and the reproduced samples. The results showed that the color reproduction system appropriately works for both groups of samples located inside the color gamut of output device, i.e. printer, and those out of gamut samples while the later logically leads to greater errors.
Distributed coloring with O(sqrt. log n) bitsSubhajit Sahu
Distributed Coloring with O˜(√log n) Bits
K Kothapalli, M Onus, C Scheideler, C Schindelhauer
Proc. of IEEE International Parallel and Distributed Processing Symposium …
We consider the well-known vertex coloring problem: given a graph G, find a coloring of its vertices so that no two neighbors in G have the same color. It is trivial to see that every graph of maximum degree∆ can be colored with∆+ 1 colors, and distributed algorithms that find a (∆+ 1)-coloring in a logarithmic number of communication rounds, with high probability, are known since more than a decade. This is in general the best possible if only a constant number of bits can be sent along every edge in each round. In fact, we show that for the n-node cycle the bit complexity of the coloring problem is
Ω (log n). More precisely, if only one bit can be sent along each edge in a round, then every distributed coloring algorithm (ie, algorithms in which every node has the same initial state and initially only knows its own edges) needs at least Ω (log n) rounds, with high probability, to color the n–node cycle, for any finite number of colors. But what if the edges have orientations, ie, the endpoints of an edge agree on its orientation (while bits may still flow in both directions)? Edge orientations naturally occur in dynamic networks where new nodes establish connections to old nodes. Does this allow one to provide faster coloring algorithms?
This presentation is about applications of graph theory applications....it is updated version it was given at international conference at applications of graph theory at KAULALAMPUR MALYSIA 2OO7
Removing Uninteresting Bytes in Software FuzzingAftab Hussain
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
UiPath Test Automation using UiPath Test Suite series, part 6DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 6. In this session, we will cover Test Automation with generative AI and Open AI.
UiPath Test Automation with generative AI and Open AI webinar offers an in-depth exploration of leveraging cutting-edge technologies for test automation within the UiPath platform. Attendees will delve into the integration of generative AI, a test automation solution, with Open AI advanced natural language processing capabilities.
Throughout the session, participants will discover how this synergy empowers testers to automate repetitive tasks, enhance testing accuracy, and expedite the software testing life cycle. Topics covered include the seamless integration process, practical use cases, and the benefits of harnessing AI-driven automation for UiPath testing initiatives. By attending this webinar, testers, and automation professionals can gain valuable insights into harnessing the power of AI to optimize their test automation workflows within the UiPath ecosystem, ultimately driving efficiency and quality in software development processes.
What will you get from this session?
1. Insights into integrating generative AI.
2. Understanding how this integration enhances test automation within the UiPath platform
3. Practical demonstrations
4. Exploration of real-world use cases illustrating the benefits of AI-driven test automation for UiPath
Topics covered:
What is generative AI
Test Automation with generative AI and Open AI.
UiPath integration with generative AI
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Sudheer Mechineni, Head of Application Frameworks, Standard Chartered Bank
Discover how Standard Chartered Bank harnessed the power of Neo4j to transform complex data access challenges into a dynamic, scalable graph database solution. This keynote will cover their journey from initial adoption to deploying a fully automated, enterprise-grade causal cluster, highlighting key strategies for modelling organisational changes and ensuring robust disaster recovery. Learn how these innovations have not only enhanced Standard Chartered Bank’s data infrastructure but also positioned them as pioneers in the banking sector’s adoption of graph technology.
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Climate Impact of Software Testing at Nordic Testing DaysKari Kakkonen
My slides at Nordic Testing Days 6.6.2024
Climate impact / sustainability of software testing discussed on the talk. ICT and testing must carry their part of global responsibility to help with the climat warming. We can minimize the carbon footprint but we can also have a carbon handprint, a positive impact on the climate. Quality characteristics can be added with sustainability, and then measured continuously. Test environments can be used less, and in smaller scale and on demand. Test techniques can be used in optimizing or minimizing number of tests. Test automation can be used to speed up testing.
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024Neo4j
Neha Bajwa, Vice President of Product Marketing, Neo4j
Join us as we explore breakthrough innovations enabled by interconnected data and AI. Discover firsthand how organizations use relationships in data to uncover contextual insights and solve our most pressing challenges – from optimizing supply chains, detecting fraud, and improving customer experiences to accelerating drug discoveries.
Essentials of Automations: The Art of Triggers and Actions in FMESafe Software
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...SOFTTECHHUB
The choice of an operating system plays a pivotal role in shaping our computing experience. For decades, Microsoft's Windows has dominated the market, offering a familiar and widely adopted platform for personal and professional use. However, as technological advancements continue to push the boundaries of innovation, alternative operating systems have emerged, challenging the status quo and offering users a fresh perspective on computing.
One such alternative that has garnered significant attention and acclaim is Nitrux Linux 3.5.0, a sleek, powerful, and user-friendly Linux distribution that promises to redefine the way we interact with our devices. With its focus on performance, security, and customization, Nitrux Linux presents a compelling case for those seeking to break free from the constraints of proprietary software and embrace the freedom and flexibility of open-source computing.
Goodbye Windows 11: Make Way for Nitrux Linux 3.5.0!SOFTTECHHUB
As the digital landscape continually evolves, operating systems play a critical role in shaping user experiences and productivity. The launch of Nitrux Linux 3.5.0 marks a significant milestone, offering a robust alternative to traditional systems such as Windows 11. This article delves into the essence of Nitrux Linux 3.5.0, exploring its unique features, advantages, and how it stands as a compelling choice for both casual users and tech enthusiasts.
Threats to mobile devices are more prevalent and increasing in scope and complexity. Users of mobile devices desire to take full advantage of the features
available on those devices, but many of the features provide convenience and capability but sacrifice security. This best practices guide outlines steps the users can take to better protect personal devices and information.
Pushing the limits of ePRTC: 100ns holdover for 100 daysAdtran
At WSTS 2024, Alon Stern explored the topic of parametric holdover and explained how recent research findings can be implemented in real-world PNT networks to achieve 100 nanoseconds of accuracy for up to 100 days.
zkStudyClub - Reef: Fast Succinct Non-Interactive Zero-Knowledge Regex ProofsAlex Pruden
This paper presents Reef, a system for generating publicly verifiable succinct non-interactive zero-knowledge proofs that a committed document matches or does not match a regular expression. We describe applications such as proving the strength of passwords, the provenance of email despite redactions, the validity of oblivious DNS queries, and the existence of mutations in DNA. Reef supports the Perl Compatible Regular Expression syntax, including wildcards, alternation, ranges, capture groups, Kleene star, negations, and lookarounds. Reef introduces a new type of automata, Skipping Alternating Finite Automata (SAFA), that skips irrelevant parts of a document when producing proofs without undermining soundness, and instantiates SAFA with a lookup argument. Our experimental evaluation confirms that Reef can generate proofs for documents with 32M characters; the proofs are small and cheap to verify (under a second).
Paper: https://eprint.iacr.org/2023/1886
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...Neo4j
Leonard Jayamohan, Partner & Generative AI Lead, Deloitte
This keynote will reveal how Deloitte leverages Neo4j’s graph power for groundbreaking digital twin solutions, achieving a staggering 100x performance boost. Discover the essential role knowledge graphs play in successful generative AI implementations. Plus, get an exclusive look at an innovative Neo4j + Generative AI solution Deloitte is developing in-house.
20240605 QFM017 Machine Intelligence Reading List May 2024
Generalization of Ramsey Number
1. Generalization of Ramsey Numbers
Further Research on Ramsey Theorem
Asaad, Al-Ahmadgaid B.
email: alstated@gmail.com
Mindanao State University
Iligan Institute of Technology
2. Generalization
The definition of the Ramsey number R(p, q) with 2 parameters can be
generalized in a natural way to the Ramsey number R(p1 , p2 , · · · , pk )
with k parameters as follows. Let k, p1 , p2 , · · · , pk N with k ≥ 3.
The Ramsey number R(p1 , p2 , · · · , pk ) is the smallest natural number
n such that for any colouring of the edges of an n-clique by k colours:
colour 1, colour 2, · · · , colour k, there exist a colour i (i = 1, 2, · · · , k)
and a pi -clique in the resulting configuration such that all edges in the
pi -clique are coloured by colour i.
• The result of Example 3.4.1. shows that R(3, 3, 3) ≤ 17.
• In 1995, Greenwood and Gleason [GG] proved by construction that
R(3, 3, 3) ≥ 17.
• Thus, R(3, 3, 3) = 17
2 of 18
3. Generalization
The definition of the Ramsey number R(p, q) with 2 parameters can be
generalized in a natural way to the Ramsey number R(p1 , p2 , · · · , pk )
with k parameters as follows. Let k, p1 , p2 , · · · , pk N with k ≥ 3.
The Ramsey number R(p1 , p2 , · · · , pk ) is the smallest natural number
n such that for any colouring of the edges of an n-clique by k colours:
colour 1, colour 2, · · · , colour k, there exist a colour i (i = 1, 2, · · · , k)
and a pi -clique in the resulting configuration such that all edges in the
pi -clique are coloured by colour i.
• The result of Example 3.4.1. shows that R(3, 3, 3) ≤ 17.
• In 1995, Greenwood and Gleason [GG] proved by construction that
R(3, 3, 3) ≥ 17.
• Thus, R(3, 3, 3) = 17
2 of 18
4. Generalization
The definition of the Ramsey number R(p, q) with 2 parameters can be
generalized in a natural way to the Ramsey number R(p1 , p2 , · · · , pk )
with k parameters as follows. Let k, p1 , p2 , · · · , pk N with k ≥ 3.
The Ramsey number R(p1 , p2 , · · · , pk ) is the smallest natural number
n such that for any colouring of the edges of an n-clique by k colours:
colour 1, colour 2, · · · , colour k, there exist a colour i (i = 1, 2, · · · , k)
and a pi -clique in the resulting configuration such that all edges in the
pi -clique are coloured by colour i.
• The result of Example 3.4.1. shows that R(3, 3, 3) ≤ 17.
• In 1995, Greenwood and Gleason [GG] proved by construction that
R(3, 3, 3) ≥ 17.
• Thus, R(3, 3, 3) = 17
2 of 18
5. Example
From Exercise 42. Show that R(3, 3, 2) = 6
Proof. Let v0 be a vertex from any of the six vertices. Joining the
vertex v0 to the vertices that incident to it, we have
v0
v1
v2
v3
v4
v5
If we are going to colour the edges with either red, blue, or yellow.
Then, by Pigeonhole principle, there are at least 3 edges coloured with
either of the three colours.
3 of 18
6. Assuming the edges were {(v0 ,v1 ), (v0 ,v2 ), and (v0 ,v3 )} and that it is
coloured with red. Then
v0
v1
v2
v3
If any of the edges between v1 , v2 , and v3 is coloured with red, then
we can form a monochromatic triangle of colour red.
v0
v1
4 of 18
v2
v3
7. If none of them is coloured with red, then either blue or yellow is
the colour of the edges. Suppose the colour of the edge between the
vertices v1 and v2 is blue, and the edge between the vertices v2 and v3
is yellow. That is,
v0
v1
v2
v3
Then, we can form a single edge coloured with blue, or an edge
coloured with yellow.
5 of 18
8. Suppose, the edges between the vertices v1 , v2 , and v3 are coloured
with blue. If the edge formed between vertices v1 and v3 is coloured
with red. Then, we have a single monochromatic triangle coloured
with red. But, if the edge is coloured with blue, then we can have
a monochromatic triangle of colour blue. In addition, if the edge is
coloured with yellow, then we have a single line (edge) coloured with
yellow.
v0
v1
6 of 18
v2
v0
v3
v1
v2
v3
9. v0
v1
v2
v3
Hence, using 6 vertices is enough to show that there exist 3-clique of
blue, 3-clique of red, or 2-clique of yellow.
7 of 18
10. Applications of Ramsey Numbers
These are the areas where we can apply Ramsey numbers
• Number Theory
• Geometry
• Communications
• Decision Making
• Computer Science
http://www.cs.umd.edu/~gasarch/ramsey/ramsey.html
• and more...
8 of 18
11. Applications of Ramsey Numbers
These are the areas where we can apply Ramsey numbers
• Number Theory
• Geometry
• Communications
• Decision Making
• Computer Science
http://www.cs.umd.edu/~gasarch/ramsey/ramsey.html
• and more...
8 of 18
12. Applications of Ramsey Numbers
These are the areas where we can apply Ramsey numbers
• Number Theory
• Geometry
• Communications
• Decision Making
• Computer Science
http://www.cs.umd.edu/~gasarch/ramsey/ramsey.html
• and more...
8 of 18
13. Applications of Ramsey Numbers
These are the areas where we can apply Ramsey numbers
• Number Theory
• Geometry
• Communications
• Decision Making
• Computer Science
http://www.cs.umd.edu/~gasarch/ramsey/ramsey.html
• and more...
8 of 18
14. Applications of Ramsey Numbers
These are the areas where we can apply Ramsey numbers
• Number Theory
• Geometry
• Communications
• Decision Making
• Computer Science
http://www.cs.umd.edu/~gasarch/ramsey/ramsey.html
• and more...
8 of 18
15. Applications of Ramsey Numbers
These are the areas where we can apply Ramsey numbers
• Number Theory
• Geometry
• Communications
• Decision Making
• Computer Science
http://www.cs.umd.edu/~gasarch/ramsey/ramsey.html
• and more...
8 of 18
17. Ramsey Theorem
In combinatorics, Ramsey’s theorem states that in any colouring of the
edges of a sufficiently large complete graph, one will find monochromatic complete subgraphs. For two colours, Ramsey’s theorem states
that for any pair of positive integers (p, q), there exists a least positive
integer R(p, q) such that for any complete graph on R(p, q) vertices,
whose edges are coloured red or blue, there exists either a complete
subgraph on p vertices which is entirely blue, or a complete subgraph
on q vertices which is entirely red.
10 of 18
18. More on Theorem
• Extension of the Theorem
The theorem can also be extended to hypergraphs. An m-hypergraph
is a graph whose ”edges” are sets of m vertices - in a normal graph
an edge is a set of 2 vertices.
• Infinite Ramsey theorem
A further result, also commonly called Ramsey’s theorem, applies
to infinite graphs. In a context where finite graphs are also being
discussed it is often called the ”Infinite Ramsey theorem”.
Theorem: Let X be some countably infinite set and colour the
elements of X (n) (the subsets of X of size n) in c different colours.
Then there exists some infinite subset M of X such that the size n
subsets of M all have the same colour.
11 of 18
19. List of Ramsey Numbers
List of Ramsey numbers for p-clique and q-clique, p, q ≤ 19
p
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
q
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
12 of 18
R(p, q)
6
9
14
18
23
28
36
[40, 43]
[46, 51]
[52, 59]
[59, 69]
[66, 78]
[73, 88]
[79, 135]
[92, 152]
[98, 170]
[106, 189]
Reference
Greenwood and Gleason 1955
Greenwood and Gleason 1955
Greenwood and Gleason 1955
Graver and Yackel 1968
Kalbfleisch 1966
McKay and Min 1992
Grinstead and Roberts 1982
Exoo 1989c, Radziszowski and Kreher 1988
Radziszowski and Kreher 1988
Exoo 1993, Radziszowski and Kreher 1988, Exoo 1998, Lesser 2001
Piwakowski 1996, Radziszowski and Kreher 1988
Exoo (unpub.), Radziszowski and Kreher 1988
Wang and Wang 1989, Radziszowski (unpub.), Lesser 2001
Wang and Wang 1989
Wang et al. 1994
Wang et al. 1994
Wang et al. 1994
20. Continuation...
p
3
3
3
3
4
4
4
4
4
4
4
4
4
4
4
4
4
4
4
q
20
21
22
23
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
13 of 18
R(p, q)
[109, 209]
[122, 230]
[125, 252]
[136, 275]
18
25
[35, 41]
[49, 61]
[56, 84]
[73, 115]
[92, 149]
[97, 191]
[128, 238]
[133, 291]
[141, 349]
[153, 417]
[153, 815]
[182, 968]
[182, 1139]
Reference
Wang et al. 1994
Wang et al. 1994
Wang et al. 1994
Wang et al. 1994
Greenwood and Gleason 1955
McKay and Radziszowski 1995
Exoo (unpub.), McKay and Radziszowski 1995
Exoo 1989a, Mackey 1994
Exoo 1998, Exoo 2002
Radziszowski 1988, Mackey 1994
Piwakowski 1996, Mackey 1994, Harboth and Krause 2003
Piwakowski 1996, Spencer 1994, Burr et al. 1989
Su et al. 1998, Spencer 1994
Xu and Xie 2002
Xu and Xie 2002
Xu and Xie 2002
Luo et al. 2001
21. p
8
8
8
8
8
8
9
9
10
11
12
13
14
15
16
17
18
19
q
16
17
18
19
20
21
9
10
10
11
12
13
14
15
16
17
18
19
R(p, q)
[861, 170543]
[861, 245156]
[871, 346103]
[1054, 480699]
[1094, 657799]
[1328, 888029]
[565, 6588]
[580, 12677]
[798, 23556]
[1597, 184755]
[1637, 705431]
[2557, 2704155]
[2989, 10400599]
[5485, 40116599]
[5605, 155117519]
[8917, 601080389]
[11005, 2333606219]
[17885, 9075135299]
Reference
Xu and Xie 2002
Xu and Xie 2002
Xu and Xie 2002
Su et al. 2002
Su et al. 2002
Shearer 1986, Shi and Zheng 2001
Xu and Xie 2002
Shearer 1986, Shi 2002
Mathon 1987
Xu and Xie 2002
Mathon 1987
Mathon 1987
Mathon 1987
Mathon 1987
Luo et al. 2002
Luo et al. 2002
Luo et al. 2002
more at http://mathworld.wolfram.com/RamseyNumber.html
14 of 18
22. References
• Jaam, M. J. (2006). A new construction technique of a triangle-free
3-colored K16s. Qatar. Elsevier
• Leader, Imre (2001). Friends and Strangers. Plus Magazine.
http://plus.maths.org/content/friends-and-strangers
• http://cstheory.stackexchange.com/questions/
9500/application-of-ramsey-numbers
• http://en.wikipedia.org/wiki/Ramsey%27s_theorem
(Proof of Infinite Ramsey Theorem)
15 of 18
23. Special Thanks
Thanks to these guys for helping me in my LateX graphs:
• Claudio Fiandrino
• Jake
16 of 18
24. Exercises
Problems 34 and 35.
• R(3, 5) = 14
• R(4, 4) ≤ 18
• R(3, 6) ≤ 19
Answer
• Prove that R(3, 5) = 14
Proof. Using the theorem 3.5.1 we have.
R(3, 5) ≤ R(2, 5) + R(3, 4) = 5 + 9
R(3, 4) was already shown in page 135.
17 of 18