Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Anurag Bishnoi"'
Autor:
Anurag Bishnoi, Simona Boyadzhiyska, Dennis Clemens, Pranshu Gupta, Thomas Lesgourgues, Anita Liebenau
Publikováno v:
Thomas Lesgourgues
A graph $G$ is said to be $q$-Ramsey for a $q$-tuple of graphs $(H_1,\ldots,H_q)$, denoted by $G\to_q(H_1,\ldots,H_q)$, if every $q$-edge-coloring of $G$ contains a monochromatic copy of $H_i$ in color $i,$ for some $i\in[q]$. Let $s_q(H_1,\ldots,H_q
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb99b23fe9489453e762239dd02f5c29
https://doi.org/10.1137/21m1444953
https://doi.org/10.1137/21m1444953
Autor:
Valentina Pepe, Anurag Bishnoi
Publikováno v:
SIAM Journal on Discrete Mathematics. 34:230-240
A famous conjecture of Ryser states that every $r$-partite hypergraph has vertex cover number at most $r - 1$ times the matching number. In recent years, hypergraphs meeting this conjectured bound,...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e9866c6a93dcf5422edca66d6cf0751f
https://doi.org/10.1137/19m1241556
https://doi.org/10.1137/19m1241556
Autor:
Anurag Bishnoi, Thomas Lesgourgues
Publikováno v:
Thomas Lesgourgues
We prove that $s_r(K_{k+1}) = O(k^3 r^3 \log^3 k)$, where $s_r(K_k)$ is the Ramsey parameter introduced by Burr, Erd\H{o}s and Lov\'{a}sz in 1976, which is defined as the smallest minimum degree of a graph $G$ such that any $r$-colouring of the edges
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1600196d8616814fd607bcf4ddc59bab
Publikováno v:
Proceedings of the American Mathematical Society. 147:4107-4122
We give conditions under which the number of solutions of a system of polynomial equations over a finite field F_q of characteristic p is divisible by p. Our setup involves the substitution t_i |-> f_i(t_i) for auxiliary polynomials f_1,...,f_n in F_
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d6a2a41e52effeab6a1feba65b215ae
https://doi.org/10.1090/proc/14181
https://doi.org/10.1090/proc/14181
Publikováno v:
Journal of Combinatorial Theory. Series B, 179
A well-known conjecture, often attributed to Ryser, states that the cover number of an $r$-partite $r$-uniform hypergraph is at most $r - 1$ times larger than its matching number. Despite considerable effort, particularly in the intersecting case, th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b85729099f688ba310ef52a988b9a67
https://doi.org/10.1016/j.jcta.2020.105366
https://doi.org/10.1016/j.jcta.2020.105366
Publikováno v:
COMBINATORICA
A construction of Alon and Krivelevich gives highly pseudorandom $K_k$-free graphs on $n$ vertices with edge density equal to $\Theta(n^{-1/(k -2)})$. In this short note we improve their result by constructing an infinite family of highly pseudorando
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f8a498c38e54dc0b775ac0240c0c0e51
https://hdl.handle.net/1854/LU-8662761
https://hdl.handle.net/1854/LU-8662761
Publikováno v:
Combinatorics, Probability and Computing. 27:310-333
A 1993 result of Alon and F\"uredi gives a sharp upper bound on the number of zeros of a multivariate polynomial over an integral domain in a finite grid, in terms of the degree of the polynomial. This result was recently generalized to polynomials o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf034882f164826502b852f6961c68f0
https://doi.org/10.1017/s0963548317000566
https://doi.org/10.1017/s0963548317000566
Autor:
B. De Bruyn, Anurag Bishnoi
Publikováno v:
Journal of Algebraic Combinatorics. 48:157-178
In recent work we constructed two new near octagons, one related to the finite simple group $$\mathrm {G}_2(4)$$ and another one as a sub-near-octagon of the former. In the present paper, we give a direct construction of this sub-near-octagon using a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42003726aa84128fa3e2457017a6592d
https://doi.org/10.1007/s10801-017-0795-x
https://doi.org/10.1007/s10801-017-0795-x
Autor:
Bart De Bruyn, Anurag Bishnoi
Publikováno v:
European Journal of Combinatorics. 62:115-123
We prove that there are no semi-finite generalized hexagons with q + 1 points on each line containing the known generalized hexagons of order q as full subgeometries when q is equal to 3 or 4 , thus contributing to the existence problem of semi-finit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::88e1ebd5c9f38b87785f05a5c2474413
https://doi.org/10.1016/j.ejc.2016.12.003
https://doi.org/10.1016/j.ejc.2016.12.003
We prove that a minimal $t$-fold blocking set in a finite projective plane of order $n$ has cardinality at most \[\frac{1}{2} n\sqrt{4tn - (3t + 1)(t - 1)} + \frac{1}{2} (t - 1)n + t.\] This is the first general upper bound on the size of minimal $t$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13138cb2da2684d9ddd621db82b907c8
https://biblio.vub.ac.be/vubir/minimal-multiple-blocking-sets(42082c5e-f4c0-4189-b834-4972d5e7822c).html
https://biblio.vub.ac.be/vubir/minimal-multiple-blocking-sets(42082c5e-f4c0-4189-b834-4972d5e7822c).html