Graphs and AlgorithmsIn this paper new exact values of the Zarankiewicz function z(m,n;s,t) are obtained assuming certain requirements on the parameters. Moreover, all the corresponding extremal graphs are characterized. Finally, an extension of this problem to 3-partite graphs is studied
We prove several results from different areas of extremal combinatorics, giving complete or partial ...
Given a family of graphs H, the extremal number ex(n;H) is the largest m for which there exists a gr...
AbstractWe introduce a containment relation of hypergraphs which respects linear orderings of vertic...
In this paper new exact values of the Zarankiewicz function z(m,n; s, t) are obtained assuming certa...
The bipartite Ramsey number b(m, n) is the minimum b such that any 2-coloring of Kb,b results in a m...
Non UBCUnreviewedAuthor affiliation: IMJ - PRG, Univ. Paris Diderot Paris 7Postdoctora
AbstractThe extremal number ex(n;TKp) denotes the maximum number of edges of a graph of order n cont...
The bipartiteness of a graph is the minimum number of vertices whose deletion from G results in a bi...
We prove a selection of results from different areas of extremal combinatorics, including complete o...
Let G be a connected k-regular bipartite graph with bipartition $V(G) = X \cap Y$ and adjacency matr...
Given integers p > k > 0, we consider the following problem of extremal graph theory: How many edges...
We prove several results from different areas of extremal combinatorics, including complete or parti...
The well-known Zarankiewicz problem [Za] is to determine the least positive integer Z(m, n, r, s) su...
In graph theory, as in many fields of mathematics, one is often interested in finding the maxima or ...
For two graphs T and H with no isolated vertices and for an integer n, let ex(n, T,H) denote the max...
We prove several results from different areas of extremal combinatorics, giving complete or partial ...
Given a family of graphs H, the extremal number ex(n;H) is the largest m for which there exists a gr...
AbstractWe introduce a containment relation of hypergraphs which respects linear orderings of vertic...
In this paper new exact values of the Zarankiewicz function z(m,n; s, t) are obtained assuming certa...
The bipartite Ramsey number b(m, n) is the minimum b such that any 2-coloring of Kb,b results in a m...
Non UBCUnreviewedAuthor affiliation: IMJ - PRG, Univ. Paris Diderot Paris 7Postdoctora
AbstractThe extremal number ex(n;TKp) denotes the maximum number of edges of a graph of order n cont...
The bipartiteness of a graph is the minimum number of vertices whose deletion from G results in a bi...
We prove a selection of results from different areas of extremal combinatorics, including complete o...
Let G be a connected k-regular bipartite graph with bipartition $V(G) = X \cap Y$ and adjacency matr...
Given integers p > k > 0, we consider the following problem of extremal graph theory: How many edges...
We prove several results from different areas of extremal combinatorics, including complete or parti...
The well-known Zarankiewicz problem [Za] is to determine the least positive integer Z(m, n, r, s) su...
In graph theory, as in many fields of mathematics, one is often interested in finding the maxima or ...
For two graphs T and H with no isolated vertices and for an integer n, let ex(n, T,H) denote the max...
We prove several results from different areas of extremal combinatorics, giving complete or partial ...
Given a family of graphs H, the extremal number ex(n;H) is the largest m for which there exists a gr...
AbstractWe introduce a containment relation of hypergraphs which respects linear orderings of vertic...
DOI
Add to ORKG