Results 21 to 30 of about 5,650 (159)
International Journal of Mathematical Combinatorics, Vol.7A [PDF]
, 2013 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
Well quasi-order in combinatorics : embeddings and homomorphisms
, 2015 The notion of well quasi-order (wqo) from the theory of ordered sets often arises naturally in contexts where one deals with infinite collections of structures which can somehow be compared, and it then represents a useful discriminator between ‘tame ...
Ruskuc, Nik +3 more
core +1 more source
ICECA2023 - Yaakov Malinovsky - International Conference on Enumerative Combinatorics & Applications
, 2023 ICECA2023 , International Conference on Enumerative Combinatorics & Applications, September 4-6, 2023, Virtual, University of Haifa, Israelhttps://www.youtube.com/watch?v ...
Malinovsky, Yaakov, Alon, Noga
core +1 more source
Recent trends in combinatorics
, 2016 This volume presents some of the research topics discussed at the 2014-2015 Annual Thematic Program Discrete Structures: Analysis and Applications at the Institute for Mathematics and its Applications during Fall 2014, when combinatorics was the focus ...
Griggs, Jerrold +4 more
core +2 more sources
International Journal of Mathematical Combinatorics, Vol.4 [PDF]
, 2010 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
Graphs of Linear Growth have Bounded Treewidth
, 2023 A graph class G has linear growth if, for each graph G ∈ G and every positive integer r, every subgraph of G with radius at most r contains O(r) vertices. In this paper, we show that every graph class with linear growth has bounded treewidth. Mathematics
David Wood +12 more
core +1 more source
SMARANDACHE MULTI-SPACE THEORY, Second Edition [PDF]
, 2011 We are used to the idea that our space has three dimensions: length, breadth and height with time providing the fourth dimension of spacetime by Einstein. In the string or superstring theories, we encounter 10 dimensions.
MAO, Linfan
core +1 more source
On the conjunctive capacity of graphs [PDF]
, 2013 The investigation of the asymptotic behaviour of various graph parameters in powers of a fixed graph G=(V,E) is motivated by problems in information theory and extremal ...
Chlebikova, Janka +5 more
core +1 more source
Combinatorics' A journey to elementary mathematics education [PDF]
, 2003 Combinatorics is a part of discrete mathematics. It is a part of modern mathematics that seem to penetrate into the mathematics subject taught in school. Combinatorics forms an inseparable part of the modernization of elementary mathematics education.
Scholtzová, Iveta
core
AUTOMORPHISM GROUPS OF MAPS, SURFACES AND SMARANDACHE GEOMETRIES [PDF]
, 2011 Automorphism groups survey similarities on mathematical systems, which appear nearly in all mathematical branches, such as those of algebra, combinatorics, geometry, · · · and theoretical physics, theoretical chemistry, etc..
MAO, LINFAN
core +1 more source