Format:
Online-Ressource (Approx. 600 p, online resource)
ISBN:
9788876424755
Series Statement:
CRM Series 16
Content:
In the tradition of EuroComb'01 (Barcelona), Eurocomb'03 (Prague), EuroComb'05 (Berlin), Eurocomb'07 (Seville), Eurocomb'09 (Bordeaux), and Eurocomb'11 (Budapest), this volume covers recent advances in combinatorics and graph theory including applications in other areas of mathematics, computer science and engineering. Topics include, but are not limited to: Algebraic combinatorics, combinatorial geometry, combinatorial number theory, combinatorial optimization, designs and configurations, enumerative combinatorics, extremal combinatorics, ordered sets, random methods, topological combinatorics.
Note:
Auf Homepage von Springer unter der Reihe „Publications of the Scuola Normale Superiore“ aufgeführt
,
Includes bibliographical references
,
Adjacent vertex-distinguishing edge coloring of graphs
,
Directed cycle double covers: hexagon graphs
,
Erdős problemsA problem of Erdős and Sós on 3-graphs
,
HamiltonicityProof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
,
On independent transversals in matroidal Latin rectangles
,
PostersEnumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method
,
Rainbow path and minimum degree in properly edge colored graphs
,
B-Coloring Graphs with Girth at Least 8
,
The circular chromatic index of k-regular graphs
,
Coloring d-Embeddable k-Uniform Hypergraphs
,
Homomorphisms of signed bipartite graphs
,
GamesA threshold for the Maker-Breaker clique game
,
On the threshold bias in the oriented cycle game
,
Building spanning trees quickly in Maker-Breaker games
,
Dicots, and a taxonomic ranking for misère games
,
Avoider-Enforcer star games
,
Algebra and PolynomialsFooling-sets and rank in nonzero characteristic
,
Krasner near-factorizations and 1-overlapped factorizations
,
Finding an Odd K 3,3
,
Zero-error source-channel coding with entanglement
,
Ramsey TheoryRamsey numbers for bipartite graphs with small bandwidth
,
Polynomial bounds on geometric Ramsey numbers of ladder graphs
,
Geometry and SurfacesArrangements of pseudocircles and circles
,
Extended abstract for structure results for multiple tilings in 3D
,
On the nonexistence of k-reptile simplices in R3 ana R4
,
Homogeneous selections from hyperplanes
,
Conic theta functions and their relations to theta functions
,
The Carathéodory number of the P 3 convexity of chordal graphs
,
Locally-maximal embeddings of graphs in orientable surfaces
,
A characterization of triangulations of closed surfaces
,
An analogue of the Erdős-Ko-Rado theorem for multisets
,
Polynomial gap extensions of the Erdős-Pósa theorem
,
The Erdős-Pósa property for long circuits
,
HypergraphsA hypergraph Turán theorem via Lagrangians of intersecting families
,
Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs
,
Fractional and integer matchings in uniform hypergraphs
,
Cubic graphsOn cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings
,
Relating ordinary and total domination in cubic graphs of large girth
,
Snarks with large oddness and small number of vertices
,
Non-trivial snarks with given circular chromatic index
,
Proof of the 1-factorization and Hamilton decomposition conjectures
,
Regular hypergraphs: asymptotic counting and loose Hamilton cycles
,
TrianglesDynamic concentration of the triangle-free process
,
Subcubic triangle-free graphs have fractional chromatic number at most 14/5
,
Henneberg steps for triangle representations
,
Cycles and Girth of GraphsCycle-continuous mappingsorder structure
,
On the structure of graphs with given odd girth and large minimum degree
,
On the order of cages with a given girth pair
,
Enumerations, Lattices and TableauxDirected and multi-directed animals on the King's lattice
,
Results and conjectures on the number of standard strong marked tableaux
,
Multivariate Lagrange inversion formula and the cycle lemma
,
Combinatorics and algorithmsSimplifying inclusionexclusion formulas
,
Majority and plurality problems
,
Combinatorial bounds on relational complexity
,
A combinatorial approach to colourful simplicial depth
,
Complexity and approximation of the smallest k-enclosing ball problem
,
Testing uniformity of stationary distribution
,
On a covering problem in the hypercube
,
A classification of positive posets using isotropy groups of Dynkin diagrams
,
Polynomial graph invariants from homomorphism numbers
,
An Erdős-Ko-Rado theorem for matchings in the complete graph
,
A constrained path decomposition of cubic graphs and the path number of cacti
,
On push chromatic number of planar graphs and planar p-cliques
,
Firefighting with general weights
,
Nowhere-zero flows on signed regular graphs
,
New transience bounds for long walks in weighted digraphs
,
Complexity of determining the irregular chromatic index of a graph
Additional Edition:
ISBN 9788876424748
Additional Edition:
Erscheint auch als Druck-Ausgabe The Seventh European Conference on Combinatorics, Graph Theory and Applications Pisa : Edizioni Della Normale, 2013 ISBN 9788876424748
Language:
English
DOI:
10.1007/978-88-7642-475-5
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
Bookmarklink
