Journal: European Journal of Combinatorics
Loading...
Abbreviation
Eur. j. comb.
Publisher
Elsevier
39 results
Search Results
Publications 1 - 10 of 39
- Global Maker-Breaker games on sparse graphsItem type: Journal Article
European Journal of CombinatoricsHefetz, Dan; Krivelevich, Michael; Stojakovic, Milos; et al. (2011) - Weak and strong k-connectivity gamesItem type: Conference Paper
European Journal of CombinatoricsFerber, Asaf; Hefetz, Dan (2014) - Counting cliques in 1-planar graphsItem type: Journal Article
European Journal of CombinatoricsGollin, J. Pascal; Hendrey, Kevin; Methuku, Abhishek; et al. (2023)The problem of maximising the number of cliques among n-vertex graphs from various graph classes has received considerable attention. We investigate this problem for the class of 1-planar graphs where we determine precisely the maximum total number of cliques as well as the maximum number of cliques of any fixed size. We also precisely characterise the extremal graphs for these problems. - A Ramsey theorem for multiposetsItem type: Journal Article
European Journal of CombinatoricsDraganić, Nemanja; Mašulović, Dragan (2019) - Interleaved adjoints of directed graphsItem type: Journal Article
European Journal of CombinatoricsFoniok, Jan; Nešetřil, Jaroslav; Tardif, Claude (2011) - Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphsItem type: Journal Article
European Journal of CombinatoricsBottcher, Julia; Prüssmann, Klaas P.; Taraz, Anusch; et al. (2010) - Cutoff on graphs and the Sarnak–Xue density of eigenvaluesItem type: Journal Article
European Journal of CombinatoricsGolubev, Konstantin; Kamber, Amitay (2022)It was recently shown in Lubetzky and Peres (2016) and Sardari (2019) that Ramanujan graphs, i.e., graphs with the optimal spectrum, exhibit cutoff of the simple random walk in an optimal time and have an optimal almost-diameter. We show that this spectral condition can be replaced by a weaker condition, the Sarnak–Xue density property, to deduce similar results. This allows us to prove that some natural families of Schreier graphs of the SL$_2$($\mathbb{F}$$_t$)-action on the projective line exhibit cutoff, thus proving a special case of a conjecture of Rivin and Sardari (2019). - Eigenvalues of subgraphs of the cubeItem type: Journal Article
European Journal of CombinatoricsBollobás, Béla; Lee, Jonathan; Letzter, Shoham (2018) - Product-free sets in the free semigroupItem type: Journal Article
European Journal of CombinatoricsLeader, Imre; Letzter, Shoham; Narayanan, Bhargav; et al. (2020) - Combinatorial geometries: Matroids, oriented matroids and applications. Special issue in memory of Michel Las Vergnas PrefaceItem type: Other Journal Item
European Journal of CombinatoricsCordovil, Raul; Fukuda, Komei; Gioan, Emeric; et al. (2015)
Publications 1 - 10 of 39