default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 151
Volume 151, November 2021
- Debsoumya Chakraborti, Da Qi Chen:
Many cliques with few edges and bounded maximum degree. 1-20 - János Pach, István Tomon:
Erdős-Hajnal-type results for monotone paths. 21-37 - Éva Czabarka
, Inne Singgih, László A. Székely:
Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza. 38-45 - Nathan J. Bowler, Johannes Carmesin:
On the intersection conjecture for infinite trees of matroids. 46-82 - François Dross, Frédéric Havet:
On the unavoidability of oriented trees. 83-110 - Michal Pilipczuk, Sebastian Siebertz:
Polynomial bounds for centered colorings on proper minor-closed graph classes. 111-147 - Chun-Hung Liu:
Packing and covering immersions in 4-edge-connected graphs. 148-222 - Jan Kurkofka:
The Farey graph is uniquely determined by its connectivity. 223-234 - Mostafa Einollahzadeh, Mohammad Mahdi Karkhaneei:
On the lower bound of the sum of the algebraic connectivity of a graph and its complement. 235-249 - Florian Lehner:
On the cop number of toroidal graphs. 250-262 - Joshua Erde, J. Pascal Gollin, Attila Joó:
Enlarging vertex-flames in countable digraphs. 263-281 - Michael Giudici, Carlisle S. H. King:
On edge-primitive 3-arc-transitive graphs. 282-306 - Matija Bucic, Nemanja Draganic, Benny Sudakov, Tuan Tran:
Unavoidable hypergraphs. 307-338 - Bohdan Kivva:
A characterization of Johnson and Hamming graphs and proof of Babai's conjecture. 339-374 - Alice L. L. Gao, Matthew H. Y. Xie:
The inverse Kazhdan-Lusztig polynomial of a matroid. 375-392 - Ewan Davies, Matthew Jenssen, Will Perkins:
A proof of the upper matching conjecture for large graphs. 393-416 - Maria Chudnovsky, Paul D. Seymour:
Erdős-Hajnal for cap-free graphs. 417-434 - A. L. Perezhogin:
On the spectrum of Hamiltonian cycles in the n-cube. 435-464 - Shagnik Das, Alexey Pokrovskiy, Benny Sudakov:
Isomorphic bisections of cubic graphs. 465-481 - A. Nicholas Day, Victor Falgas-Ravry:
Maker-breaker percolation games II: Escaping to infinity. 482-508
- Tom Kelly, Luke Postle:
Corrigendum to "A local epsilon version of Reed's Conjecture" [J. Combin. Theory Ser. B 141 (2020) 181-222]. 509-512
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-03 23:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
