Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/jct/jcta164.bht:"
@article{DBLP:journals/jct/BeuleV19, author = {Jan De Beule and Geertrui Van de Voorde}, title = {The minimum size of a linear set}, journal = {J. Comb. Theory {A}}, volume = {164}, pages = {109--124}, year = {2019}, url = {https://doi.org/10.1016/j.jcta.2018.12.008}, doi = {10.1016/J.JCTA.2018.12.008}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/BeuleV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/DilksSV19, author = {Kevin Dilks and Jessica Striker and Corey Vorland}, title = {Rowmotion and increasing labeling promotion}, journal = {J. Comb. Theory {A}}, volume = {164}, pages = {72--108}, year = {2019}, url = {https://doi.org/10.1016/j.jcta.2018.12.007}, doi = {10.1016/J.JCTA.2018.12.007}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/DilksSV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/DuganGGS19, author = {William Dugan and Sam Glennon and Paul E. Gunnells and Einar Steingr{\'{\i}}msson}, title = {Tiered trees, weights, and \emph{q}-Eulerian numbers}, journal = {J. Comb. Theory {A}}, volume = {164}, pages = {24--49}, year = {2019}, url = {https://doi.org/10.1016/j.jcta.2018.12.002}, doi = {10.1016/J.JCTA.2018.12.002}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/DuganGGS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/HowardSTWW19, author = {David M. Howard and Noah Streib and William T. Trotter and Bartosz Walczak and Ruidong Wang}, title = {Dimension of posets with planar cover graphs excluding two long incomparable chains}, journal = {J. Comb. Theory {A}}, volume = {164}, pages = {1--23}, year = {2019}, url = {https://doi.org/10.1016/j.jcta.2018.11.016}, doi = {10.1016/J.JCTA.2018.11.016}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/HowardSTWW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/HuangLW19, author = {Li{-}Ping Huang and Benjian Lv and Kaishun Wang}, title = {Erd{\H{o}}s-Ko-Rado theorem, Grassmann graphs and \emph{p}\({}^{\mbox{\emph{s}}}\)-Kneser graphs for vector spaces over a residue class ring}, journal = {J. Comb. Theory {A}}, volume = {164}, pages = {125--158}, year = {2019}, url = {https://doi.org/10.1016/j.jcta.2019.01.003}, doi = {10.1016/J.JCTA.2019.01.003}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/HuangLW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/MeloW19, author = {Nolmar Melo and Andreas J. Winter}, title = {Intersection patterns of linear subspaces with the hypercube}, journal = {J. Comb. Theory {A}}, volume = {164}, pages = {60--71}, year = {2019}, url = {https://doi.org/10.1016/j.jcta.2018.12.006}, doi = {10.1016/J.JCTA.2018.12.006}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/MeloW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Schmidt19, author = {Kai{-}Uwe Schmidt}, title = {Asymptotically optimal Boolean functions}, journal = {J. Comb. Theory {A}}, volume = {164}, pages = {50--59}, year = {2019}, url = {https://doi.org/10.1016/j.jcta.2018.12.005}, doi = {10.1016/J.JCTA.2018.12.005}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/Schmidt19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.