Geodesic

Tome 88 (2019) no. 3

Sommaire

Preface
p. 361-362
Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs
p. 363-370
Majority coloring of infinite digraphs
p. 371-376
Homomorphism-homogeneity classes of countable L-colored graphs
p. 377-382
MB-Homogeneous graphs and some new HH-homogeneous graphs
p. 383-387
Localised codegree conditions for tight Hamiltonian cycles in 3-uniform hypergraphs
p. 389-394
Pop-stack sorting and its image: Permutations with overlapping runs
p. 395-402
Maximal edge-colorings of graphs
p. 403-407
Edge-ordered Ramsey numbers
p. 409-414
Big Ramsey degrees of 3-uniform hypergraphs
p. 415-422
Maximum induced subgraphs of the binomial random graph
p. 423-427
An improved upper bound on the growth constant of polyiamonds
p. 429-436
Exploring projective norm graphs
p. 437-441
On Heilbronn triangle-type problems in higher dimensions
p. 443-450
The size-Ramsey number of powers of bounded degree trees
p. 451-456
Embedding trees with maximum and minimum degree conditions
p. 457-462
Sharp bounds for decomposing graphs into edges and triangles
p. 463-468
Epsilon-colorings of strips
p. 469-473
On relaxed Šoltés's problem
p. 475-480
Most principal permutation classes, and t-stack sortable permutations, have nonrational generating functions
p. 481-487
Asymptotically good local list edge colourings
p. 489-494
Maximum number of triangle-free edge colourings with five and six colours
p. 495-499
Gallai's path decomposition conjecture for graphs with maximum E-degree at most 3
p. 501-505
Bounding the cop number of a graph by its genus
p. 507-510
Nearly orthogonal vectors and small antipodal spherical codes
p. 511-514
Bounding the tripartite-circle crossing number of complete tripartite graphs
p. 515-520
A step towards the 3k-4 conjecture in Z/pZ and an application to m-sum-free sets
p. 521-525
Recent developments on unavoidable patterns in 2-colorings of the complete graph
p. 527-532
Cycles of length three and four in tournaments
p. 533-539
On 2-factors with a specified number of components in line graphs
p. 541-546
Resilience with respect to Hamiltonicity in random graphs
p. 547-551
Cohomology groups of non-uniform random simplicial complexes
p. 553-560
Tiling edge-coloured graphs with few monochromatic bounded-degree graphs
p. 561-566
On the largest component of the critical random digraph
p. 567-572
Edge-coloring of plane graphs with many colors on faces
p. 573-576
Tree pivot-minors and linear rank-width
p. 577-583
Independent transversals versus transversals
p. 585-591
Spectra and eigenspaces of arbitrary lifts of graphs
p. 593-600
Adaptive majority problems for restricted query graphs and for weighted sets
p. 601-609
On orthogonal symmetric chain decompositions
p. 611-618
Edge colorings avoiding patterns
p. 619-623
A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems
p. 625-629
The evolution of random graphs on surfaces of non-constant genus
p. 631-636
Powers of Hamiltonian cycles in mu-inseparable graphs
p. 637-641
A rainbow blow-up lemma for almost optimally bounded edge-colourings
p. 643-649
Recognising the overlap graphs of subtrees of restricted trees is hard
p. 651-658
Mixing time of the swap Markov chain and P-stability
p. 659-665
Reconfiguration graph for vertex colourings of weakly chordal graphs
p. 667-671
A note on covering Young diagrams with applications to local dimension of posets
p. 673-678
Deviation probabilities for arithmetic progressions and other regular discrete structures
p. 679-683
Doubly biased Walker-Breaker games
p. 685-688
Nearly k-distance sets
p. 689-693
Some results around the Erdős Matching Conjecture
p. 695-699
Bijections for generalized Tamari intervals via orientations
p. 701-708
Theory of limits of sequences of Latin squares
p. 709-716
Edge ordered Turán problems
p. 717-722
Generalized Turán problems for even cycles
p. 723-728
Degree conditions forcing oriented cycles
p. 729-733
Resolution of the Oberwolfach problem
p. 735-741
Guarding isometric subgraphs and Lazy Cops and Robbers
p. 743-747
The canonical Tutte polynomial for signed graphs
p. 749-754
On the maximum number of odd cycles in graphs without smaller odd cycles
p. 755-758
A graphon perspective for fractional isomorphism
p. 759-765
The structure of hypergraphs without long Berge cycles
p. 767-771
The maximum number of P_l copies in P_k-free graphs
p. 773-778
On some extremal results for order types
p. 779-785
On the achievable average degrees in 2-crossing-critical graphs
p. 787-793
Minimum degree conditions for powers of cycles and paths
p. 795-800
Ramsey properties of edge-labelled graphs via completions
p. 801-805
Extending partial automorphisms of n-partite tournaments
p. 807-811
Density and fractal property of the class of oriented trees
p. 813-818
More non-bipartite forcing pairs
p. 819-825
Dushnik-Miller dimension of stair contact complexes
p. 827-834
k-Hypergraphs with regular automorphism groups
p. 835-840
Automorphism groups of edge-transitive maps
p. 841-847
Two values of the chromatic number of a sparse random graph
p. 849-854
A new lower bound on Hadwiger-Debrunner numbers in the plane
p. 855-860
Sharp bounds for the chromatic number of random Kneser graphs
p. 861-865
On the Graovac-Pisanski index of a graph
p. 867-870
Covering 3-coloured random graphs with monochromatic trees
p. 871-875
Flow number and circular flow number of signed cubic graphs
p. 877-883
Enumeration of unsensed orientable and non-orientable maps
p. 885-890
Characterization of generalised Petersen graphs that are Kronecker covers
p. 891-895
Ramsey upper density of infinite graphs
p. 897-901
Minor-obstructions for apex sub-unicyclic graphs
p. 903-910
Coset geometries with trialities and their reduced incidence graphs
p. 911-916
Asymmetric Ramsey properties of random graphs involving cliques and cycles
p. 917-922
Distinguishing tournaments with small label classes
p. 923-928
Permutation snarks of order 2 (mod 8)
p. 929-934
Flexibility of planar graphs without 4-cycles
p. 935-940
Colouring non-even digraphs
p. 941-945
Splitting groups with cubic Cayley graphs of connectivity two
p. 947-954
The asymptotics of reflectable weighted walks in arbitrary dimension
p. 955-962
Cycles through a set of specified vertices of a planar graph
p. 963-966
On unit grid intersection graphs and several other intersection graph classes
p. 967-972
Testing isomorphism of circulant objects in polynomial time
p. 973-975
Spreading linear triple systems and expander triple systems
p. 977-984
Ordered graphs and large bi-cliques in intersection graphs of curves
p. 985-988
Symbolic method and directed graph enumeration
p. 989-996
Almost spanning universality in random graphs
p. 997-1002
A Brooks-like result for graph powers
p. 1003-1007
On the density of C7-critical graphs
p. 1009-1016
The Kuperberg conjecture for translates of convex bodies
p. 1017-1021
Minimum pair-degee for tight Hamiltonian cycles in 4-uniform hypergraphs
p. 1023-1027
On a Frankl-Wilson theorem and its geometric corollaries
p. 1029-1033
Ramsey numbers of Berge-hypergraphs and related structures
p. 1035-1042
Extremal families for Kruskal-Katona Theorem
p. 1043-1048
On disjoint holes in point sets
p. 1049-1056
t-Strong cliques and the degree-diameter problem
p. 1057-1061
Coloring triangle-free L-graphs with O(log log n) colors
p. 1063-1069
On the chromatic index of complementary prisms
p. 1071-1077
Target set in threshold models
p. 1079-1086
Switches in Eulerian graphs
p. 1087-1092
Length of cycles in generalized Petersen graphs
p. 1093-1100