Graph Theory Combinatorics And Applications

[Clara Zellinger]

Finitegraph theory abounds with applications inside mathematics itself, in computer science, and engineering. Therefore, I find it naturally to do research in graph theory and I also clearly see the necessity.

Now I'm wondering about infinite graph theory. Quite a bit of research seems to be done on it as well and of course they are a natural generalization of a useful concept. But I never saw an example where we actually need them.

I understand that they come up as infinite Cayley graphs in group theory, that the automorphism groups of infinite but locally finite graphs are topological groups, that they play some role in general topology, etc. But to me it seems they are "just there" and are not essential in the sense that a theorem about them proves something about groups or topology what we couldn't have done easily without using them.

The first book on graph theory was Knig's Theorie der endlichen undunendlichen Graphen (Theory of finite and infinite graphs) of 1936.Thus infinite graphs were part of graph theory from the very beginning.Knig's most important result on infinite graphs was the so-called Knig infinity lemma, which states that in an infinite, finitely-branching, tree there is aninfinite branch. This lemma encapsulates many arguments -- from theBolzano-Weierstrass theorem, to the completeness theorem of logic, to the proof of various Ramsey theorems --in graph-theoretic form. Knig himself used it to prove that theinfinite form of van der Waerden's theorem on arithmetic progressionsimplies the finite version, and Erdos and Szekeres (who were studentsof Knig) took up the idea in their pioneering 1935 paper on Ramseytheory.

The Rado graph (or countable random graph) is graph theory's answer to the normal distribution. It seems almost any sensible definition of drawing edges on a countable graph 'randomly' or even 'pseudo-randomly' will almost surely produce the Rado graph. The study of this specific graph (and similar 'universal' entities) could be justified simply by its ubiquity. That said, I don't know if it's had any clear applications to other areas.

Recently there has been quite a bit of activity in descriptive set theory concerning definable graphs.Benjamin Miller derived several deepclassical results such as Silver's theorem (stating that every sufficiently nice (here coanalytic) equivalence relation on a separable complete metric space either has countably many equivalence classes or there is a Cantor space of pairwise non-equivalentpoints) from results on uncountable graphs by relatively elementary proofs. The original proof of Silver's theorem used heavy set-theoretic machinery.

Wiener showed that the Wiener index number is closely correlated with the boiling points of Alkane molecules see Wiener, H. J. "Structural Determination of Paraffin Boiling Points." J. Amer. Chem. Soc. 69, 17-20, 1947.

In fact Wienere index is invariant under the action of the automorphismgroup of the graph $G$. So the study of Wiener indices is correspond to study of topological invariant theory of graphs

In fact Hyper-Wiener index is topological invariant and we calculated(when I was Bachelor degree) the hyper-Wiener index of the infinite one-pentagonal Carbon Nanocone. The graph of this molecule consists of one pentagon surrounded by layers of hexagons. If there are layers, then this graph is denoted by $G_n$

A model of set theory $\langle M,\in\rangle$ is a certain kind of directed graph. So graph theory has the capacity to serve as a foundation of mathematics, having a copy of virtually any conceivable mathematical structure within it.

In this sense, awareness of infinite graphs can have a very practical consequence: you then know that $C$ cannot be proved this way, and---if at all---you will only ever prove it by making essential use of the finiteness of the vertex set.

This predicate is easily expressed in the first-order logic of graph theory; the latter property is often abbreviated $n$-e.c. in the literature. Being triangle-freeness-preservingly so means that of course only those extension-properties are required to hold which do not immediately create a triangle.

1. G. Cherlin, Two problems on homogeneous structures, revisited. In: Model Theoretic Methods in Finite Combinatorics, M. Grohe and J.A. Makowsky eds.,Contemporary Mathematics, 558, American Mathematical Society, 2011, and also

In addition to the aforementioned many applications outside graph theory, another reason for caring about infinite graphs is that they are helpful for proving results about finite graphs. The papers below give some examples.

According to this wikipedia article _grid_theorem,Halin's grid theorem"is a precursor to the work of Robertson and Seymour linking treewidth to large grid minors", which if true provides perhaps the best example of how infinite graphs help you in the study of finite ones.

Combinatorics is an area of mathematics primarily concerned with the counting, selecting and arranging of objects,[1] both as a means and as an end in itself. It is closely related to many other areas of mathematics and has many applications ranging from logic to statistical physics and from evolutionary biology to computer science.

Combinatorics is well known for the breadth of the problems it tackles. Combinatorial problems arise in many areas of pure mathematics, notably in algebra, probability theory, topology, and geometry,[2] as well as in its many application areas. Many combinatorial questions have historically been considered in isolation, giving an ad hoc solution to a problem arising in some mathematical context. In the later twentieth century, however, powerful and general theoretical methods were developed, making combinatorics into an independent branch of mathematics in its own right.[3] One of the oldest and most accessible parts of combinatorics is graph theory, which by itself has numerous natural connections to other areas. Combinatorics is used frequently in computer science to obtain formulas and estimates in the analysis of algorithms.

The full scope of combinatorics is not universally agreed upon.[4] According to H.J. Ryser, a definition of the subject is difficult because it crosses so many mathematical subdivisions.[5] Insofar as an area can be described by the types of problems it addresses, combinatorics is involved with:

Leon Mirsky has said: "combinatorics is a range of linked studies which have something in common and yet diverge widely in their objectives, their methods, and the degree of coherence they have attained."[6] One way to define combinatorics is, perhaps, to describe its subdivisions with their problems and techniques. This is the approach that is used below. However, there are also purely historical reasons for including or not including some topics under the combinatorics umbrella.[7] Although primarily concerned with finite systems, some combinatorial questions and techniques can be extended to an infinite (specifically, countable) but discrete setting.

During the Renaissance, together with the rest of mathematics and the sciences, combinatorics enjoyed a rebirth. Works of Pascal, Newton, Jacob Bernoulli and Euler became foundational in the emerging field. In modern times, the works of J.J. Sylvester (late 19th century) and Percy MacMahon (early 20th century) helped lay the foundation for enumerative and algebraic combinatorics. Graph theory also enjoyed an increase of interest at the same time, especially in connection with the four color problem.

In the second half of the 20th century, combinatorics enjoyed a rapid growth, which led to establishment of dozens of new journals and conferences in the subject.[20] In part, the growth was spurred by new connections and applications to other fields, ranging from algebra to probability, from functional analysis to number theory, etc. These connections shed the boundaries between combinatorics and parts of mathematics and theoretical computer science, but at the same time led to a partial fragmentation of the field.

Enumerative combinatorics is the most classical area of combinatorics and concentrates on counting the number of certain combinatorial objects. Although counting the number of elements in a set is a rather broad mathematical problem, many of the problems that arise in applications have a relatively simple combinatorial description. Fibonacci numbers is the basic example of a problem in enumerative combinatorics. The twelvefold way provides a unified framework for counting permutations, combinations and partitions.

Analytic combinatorics concerns the enumeration of combinatorial structures using tools from complex analysis and probability theory. In contrast with enumerative combinatorics, which uses explicit combinatorial formulae and generating functions to describe the results, analytic combinatorics aims at obtaining asymptotic formulae.

Partition theory studies various enumeration and asymptotic problems related to integer partitions, and is closely related to q-series, special functions and orthogonal polynomials. Originally a part of number theory and analysis, it is now considered a part of combinatorics or an independent field. It incorporates the bijective approach and various tools in analysis and analytic number theory and has connections with statistical mechanics. Partitions can be graphically visualized with Young diagrams or Ferrers diagrams. They occur in a number of branches of mathematics and physics, including the study of symmetric polynomials and of the symmetric group and in group representation theory in general.

Graphs are fundamental objects in combinatorics. Considerations of graph theory range from enumeration (e.g., the number of graphs on n vertices with k edges) to existing structures (e.g., Hamiltonian cycles) to algebraic representations (e.g., given a graph G and two numbers x and y, does the Tutte polynomial TG(x,y) have a combinatorial interpretation?). Although there are very strong connections between graph theory and combinatorics, they are sometimes thought of as separate subjects.[21] While combinatorial methods apply to many graph theory problems, the two disciplines are generally used to seek solutions to different types of problems.

3a8082e126